Two proofs of Pinsker's conjecture concerning arbitrarily varying channels

DOI10.1109/18.104326MaRDI QIDQ3987461zbMATH OpenOpenAlexWikidataFDO

Authors Ning Cai, Rudolf Ahlswede

Publication date 28 June 1992

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://pub.uni-bielefeld.de/record/1780482

zbMATH Keywords

arbitrarily varying channeldeterministic list codesrandom code capacity

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• The maximal error capacity of arbitrarily varying channels for constant list sizes
• The smallest list for the arbitrarily varying channel
• On error exponents for arbitrarily varying channels

Cited in

(4)

• Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
• Exponential error bounds for random codes in the arbitrarily varying channel
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Search with noisy and delayed response

This page was built for publication: Two proofs of Pinsker's conjecture concerning arbitrarily varying channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987461)