The maximal error capacity of arbitrarily varying channels for constant list sizes

DOI10.1109/18.243460MaRDI QIDQ4307348zbMATH OpenOpenAlexFDO

Authors Rudolf Ahlswede

Publication date 4 October 1994

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

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

zbMATH Keywords

arbitrarily varying channelbalanced hypergraph packinglist codesmaximal error

Mathematics Subject Classification ID

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

Recommendations

• The smallest list for the arbitrarily varying channel
• Capacity of the arbitrarily varying channel under list decoding
• scientific article; zbMATH DE number 1456809

Cited in

(7)

• List decoding
• Capacity of the arbitrarily varying channel under list decoding
• Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
• The smallest list for the arbitrarily varying channel
• scientific article; zbMATH DE number 1456809 (Why is no real title available?)

This page was built for publication: The maximal error capacity of arbitrarily varying channels for constant list sizes

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