Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Channel capacities for list codes

From MaRDI portal
Publication:5179654
Jump to:navigation, search

DOI10.2307/3212384zbMath0271.60119OpenAlexW4245315238MaRDI QIDQ5179654

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)


Related Items

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, General theory of information transfer: Updated, Elimination of correlation in random codes for arbitrarily varying channels, List decodability at small radii, Creating order in sequence spaces with simple machines, Quantum privacy and quantum wiretap channels, Search with noisy and delayed response



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5179654&oldid=19755590"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 17:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki