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

John H. Wilson

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.011988
Error-correcting codes for a T-user binary adder channel · IEEE Trans. Inf. Theory 1988
Coding theory › multiuser coding
multiple-access channel coding		 0.011988
Error-correcting codes for a T-user binary adder channel · IEEE Trans. Inf. Theory 1988

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

decoding algorithm · 0.0
YearPublicationVenuePosition
1988 Error-correcting codes for a T-user binary adder channel
abstract
A construction is given which allows error correction of a code for the T-user binary adder channel with two codewords per user. The construction for a noisy channel is generalized to allow a greater freedom in choosing the parameters of the code without decreasing the rate sum. An example which illustrates an efficient decoding algorithm for the noisy channel is given.>
John H. Wilson
 IEEE Trans. Inf. Theory1