Two proofs of Pinsker's conjecture concerning arbitrarily varying channels

DOI10.1109/18.104326zbMath0742.94005OpenAlexW2004676367WikidataQ123365717 ScholiaQ123365717MaRDI QIDQ3987461

Ning Cai

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)

Related Items (2)

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