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

J. R. Riek

dblp:134/6404 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
cyclic codes		 0.011974
Majority decoding of some classes of binary cyclic codes · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › decoding
majority-logic decoding		 0.011974
Majority decoding of some classes of binary cyclic codes · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › cyclic codes
binary cyclic code		 0.011974
Majority decoding of some classes of binary cyclic codes · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › block codes › linear code › polynomial codes
parity-check polynomial		 0.011974
Majority decoding of some classes of binary cyclic codes · IEEE Trans. Inf. Theory 1974

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

majority-logic decoding · 0.0
YearPublicationVenuePosition
1974 Majority decoding of some classes of binary cyclic codes
abstract
This paper presents majority-decoding algorithms for four classes of binary cyclic codes. The classes are those for which the parity-check polynomial is: 1) the product of two primitive polynomials with relatively prime exponents and 2) the product of(x^r + 1)/(x + 1)and a primitive polynomial, wherer \geq 3is odd and the exponents are relatively prime, together with the corresponding nonexpurgated codes.
J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph
 IEEE Trans. Inf. Theory1