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

Lyle J. Frederickson

dblp:90/3521 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—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 · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity		 0.011991
On the Shannon capacity of DC- and Nyquist-free codes · IEEE Trans. Inf. Theory 1991
Coding theory › constrained coding
line codes		 0.011991
On the Shannon capacity of DC- and Nyquist-free codes · IEEE Trans. Inf. Theory 1991
YearPublicationVenuePosition
1991 On the Shannon capacity of DC- and Nyquist-free codes
abstract
The design of codes which are simultaneously DC- and Nyquist-free is considered. The Shannon capacity of codes that are simultaneously DC- and Nyquist-free is tabulated as a function of the number of allowed running digital sum and alternating digital sum states. For this constraint, the set of possible rational capacities is shown to be (1/4,1/2,3/4). A rate 3/4 DC- and Nyquist-free code is used to demonstrate the ability to code at the highest rational capacity available.>
Lyle J. Frederickson
 IEEE Trans. Inf. Theory1