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.
EDBT 2026 Demo / reviewers in the wild / expert

Dieter Schomaker

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

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

Theory of computation · 1 · 1 first-author

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 › cyclic codes
binary cyclic code		 0.011992
On binary cyclic codes of odd lengths from 101 to 127 · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes
code construction		 0.011992
On binary cyclic codes of odd lengths from 101 to 127 · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes
cyclic codes		 0.011992
On binary cyclic codes of odd lengths from 101 to 127 · IEEE Trans. Inf. Theory 1992

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

exhaustive search · 0.0construction y1 · 0.0construction x · 0.0
YearPublicationVenuePosition
1992 On binary cyclic codes of odd lengths from 101 to 127
abstract
All binary cyclic codes of odd lengths are checked from 101 to 127 to find codes which are better than those in a table by T. Verhoeff (1989). There are five such cases, namely, (117, 36, 32), (117, 37, 29), (117, 42, 26), (117, 49, 24), and (127, 36 35) cyclic codes. According to Verhoeff's table the previously known ranges of the highest minimum-distance were 28-40, 28-40, 25-37, 22-32, and 32-46, respectively. Applying constructions X and Y1, (120, 37, 32) and (108, 28, 32) codes were found. Moreover, the highest minimum-distances that cyclic codes of length 127 can attain are determined.>
Dieter Schomaker, Michael Wirtz
 IEEE Trans. Inf. Theory1