Channel capacities for list codes

DOI10.2307/3212384MaRDI QIDQ5179654zbMATH OpenOpenAlexFDO

Authors Rudolf Ahlswede

Publication date 1973

Published in Journal of Applied Probability (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Special processes (60K99)

Cited in

(9)

• Quantum privacy and quantum wiretap channels
• Search with noisy and delayed response
• Elimination of correlation in random codes for arbitrarily varying channels
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• Singleton-type bounds for list-decoding and list-recovery, and related results
• Point-polynomial incidences theorem with an application to Reed-Solomon codes
• List decodability at small radii
• Creating order in sequence spaces with simple machines
• General theory of information transfer: Updated

This page was built for publication: Channel capacities for list codes

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