EDBT 2026 Demo / reviewers in the wild / expert

Chao-Ming Zeng

dblp:39/5716 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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
Information theory · 67% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory
multiple-access channel		 0.011989
Achievability proof of some multiuser channel coding theorems using backward decoding · IEEE Trans. Inf. Theory 1989
Coding theory
multiuser coding		 0.011989
Achievability proof of some multiuser channel coding theorems using backward decoding · IEEE Trans. Inf. Theory 1989
Information theory › network information theory
relay channel		 0.011989
Achievability proof of some multiuser channel coding theorems using backward decoding · IEEE Trans. Inf. Theory 1989

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

backward decoding · 0.0
YearPublicationVenuePosition
1989 Achievability proof of some multiuser channel coding theorems using backward decoding
abstract
New and simpler achievability proofs that are based on the backward decoding technique are presented for the well-known coding theorems for the multiple-access channel (MAC) with perfect feedback and the degraded relay channel. A class of MACs with different generalized feedback signals is also considered, and achievable-rate regions that are larger than those previously presented in the literature are established.>
Chao-Ming Zeng, Federico Kuhlmann, Andres Buzo
 IEEE Trans. Inf. Theory1