On the converse to the coding theorem for discrete memoryless channels (Corresp.)
From MaRDI portal
Publication:5675266
DOI10.1109/TIT.1973.1055007zbMath0259.94025OpenAlexW2000446566MaRDI QIDQ5675266
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1973.1055007
Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
Bounds on Data Compression Ratio with a Given Tolerable Error Probability, On the second-order asymptotics for entanglement-assisted communication, Moderate deviation analysis for classical communication over quantum channels, Strong converse exponent for classical-quantum channel coding, Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels, Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity, Quantifying information flow in cryptographic systems, Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy, Strong converse theorems using Rényi entropies, Properties of noncommutative Rényi and Augustin information, Second-order asymptotics for the classical capacity of image-additive quantum channels
