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

Wim L. M. Hoeks

dblp:90/4178 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none

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
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity › capacity region
capacity region with feedback
0.011985
On the capacity of the two-user M -ary multiple-access channel with feedback · IEEE Trans. Inf. Theory 1985
Information theory › network information theory
multiple-access channel
0.011985
On the capacity of the two-user M -ary multiple-access channel with feedback · IEEE Trans. Inf. Theory 1985
Information theory
network information theory
0.011985
On the capacity of the two-user M -ary multiple-access channel with feedback · IEEE Trans. Inf. Theory 1985
Information theory
channel capacity
0.011985
On the capacity of the two-user M -ary multiple-access channel with feedback · IEEE Trans. Inf. Theory 1985
Information theory › channel capacity
feedback capacity
0.011985
On the capacity of the two-user M -ary multiple-access channel with feedback · IEEE Trans. Inf. Theory 1985

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

cover-leung capacity region · 0.0
YearPublicationVenuePosition
1985 On the capacity of the two-user M -ary multiple-access channel with feedback
abstract
A study is made of the Cover-Leung capacity region for two specific noiseless two-userM-ary input multiple-access channels with complete feedback. It is shown that the symmetric rate point of the Cover-Leung capacity region is on the total cooperation line for large enough values of M. Thus feedback allows communication at the same rates as if both users had complete joint knowledge of intended messages.
A. J. Han Vinck, Wim L. M. Hoeks, Karel A. Post
IEEE Trans. Inf. Theory2