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

Lawrence C. Washington

dblp:70/2704 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · unresolved

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 · 87% Algorithms and data structures · 13%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › pseudorandom sequences
feedback-with-carry shift register
0.012000
Fourier transforms and the 2-adic span of periodic binary sequences · IEEE Trans. Inf. Theory 2000
Coding theory › sequences
pseudorandom sequences
0.012000
Fourier transforms and the 2-adic span of periodic binary sequences · IEEE Trans. Inf. Theory 2000
Algorithms and data structures
fourier transform
0.012000
Fourier transforms and the 2-adic span of periodic binary sequences · IEEE Trans. Inf. Theory 2000

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

blahut theorem · 0.0
YearPublicationVenuePosition
2000 Fourier transforms and the 2-adic span of periodic binary sequences
abstract
An arithmetic or with-carry analog of Blahut's (1979) theorem is presented. This relates the length of the smallest feedback with-carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence.
Mark Goresky, Andrew Klapper, Lawrence C. Washington
IEEE Trans. Inf. Theory3