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

J. Cowles

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.011975
A new error-locating polynomial for decoding of BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory
error-correcting codes
0.011975
A new error-locating polynomial for decoding of BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › error-correcting codes › decoding › algebraic decoding
error-locator polynomial
0.011975
A new error-locating polynomial for decoding of BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › error-correcting codes › cyclic codes › BCH codes
step-by-step decoding
0.011975
A new error-locating polynomial for decoding of BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1975
YearPublicationVenuePosition
1975 A new error-locating polynomial for decoding of BCH codes (Corresp.)
abstract
We develop a new error-locating polynomial for BCH codes. This polynomial has a simple form and suggests a decoding procedure similar to Massey's step-by-step decoding.
George I. Davida, J. Cowles
IEEE Trans. Inf. Theory2