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

Harold Fredricksen

dblp:96/931 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1993
—ORCID · none

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

Theory of computation · 4 · 4 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
3 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
hamming weight		 0.011993
The number of nonlinear shift registers that produce all vectors of weight <t · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › linear recurrence sequences
shift register sequences		 0.011993
The number of nonlinear shift registers that produce all vectors of weight <t · IEEE Trans. Inf. Theory 1993
Coding theory
finite fields		 0.011981
On Trinomials xn + x2 + 1 and x8/±3 + xk + 1 Irreducible over GF(2) · Inf. Control. 1981
Coding theory › finite fields
irreducible polynomials		 0.011981
On Trinomials xn + x2 + 1 and x8/±3 + xk + 1 Irreducible over GF(2) · Inf. Control. 1981
Coding theory › sequences
sequence design		 0.011970
Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.) · IEEE Trans. Inf. Theory 1970

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

asymptotic analysis · 0.0
YearPublicationVenuePosition
1993 The number of nonlinear shift registers that produce all vectors of weight <t
abstract
It has been shown that it is possible to generate a cycle on a nonlinear shift register to contain all vectors of length n and Hamming weight>
Harold Fredricksen
 IEEE Trans. Inf. Theory1
1992 A New Look at the de Bruijn Graph
Harold Fredricksen
 Discret. Appl. Math.1
1981 On Trinomials xn + x2 + 1 and x8/±3 + xk + 1 Irreducible over GF(2)
Harold Fredricksen, R. Wisniewski
 Inf. Control.1
1970 Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.)
Harold Fredricksen
 IEEE Trans. Inf. Theory1