Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yawo Sugiyama

dblp:134/5269 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1979
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
binary linear codes
0.011979
On a (21, 11, 6) binary code (Corresp.) · IEEE Trans. Inf. Theory 1979
Coding theory › error-correcting codes › block codes
difference-set cyclic codes
0.011979
On a (21, 11, 6) binary code (Corresp.) · IEEE Trans. Inf. Theory 1979
Coding theory › error-correcting codes › block codes
linear code
0.011979
On a (21, 11, 6) binary code (Corresp.) · IEEE Trans. Inf. Theory 1979

Methods — techniques the papers use, named apart from their topics

construction x · 0.0BCH code construction · 0.0
YearPublicationVenuePosition
1979 On a (21, 11, 6) binary code (Corresp.)
abstract
It is shown that the (21,11,6) binary linear code obtained from BCH codes and a single parity check code by constructionXis equivalent to a difference-set cyclic code.
Takeo Kanai, Yawo Sugiyama
IEEE Trans. Inf. Theory2