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

T. Veugen

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.011996
A simple class of capacity-achieving strategies for discrete memoryless channels with feedback · IEEE Trans. Inf. Theory 1996
Coding theory › channel coding
feedback communication
0.011996
A simple class of capacity-achieving strategies for discrete memoryless channels with feedback · IEEE Trans. Inf. Theory 1996
Coding theory › error-correcting codes › block codes
repetition code
0.011996
A simple class of capacity-achieving strategies for discrete memoryless channels with feedback · IEEE Trans. Inf. Theory 1996

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

generating polynomials · 0.0
YearPublicationVenuePosition
1996 A simple class of capacity-achieving strategies for discrete memoryless channels with feedback
abstract
A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk (1971) to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.
T. Veugen
IEEE Trans. Inf. Theory1