Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
From MaRDI portal
Publication:4173284
DOI10.1109/TIT.1979.1056003zbMath0391.94009MaRDI QIDQ4173284
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
upper boundlower boundreliability functiondiscrete memoryless channelcorrect decoding of block codesOmura's boundrates above capacity
Related Items
Bounds on Data Compression Ratio with a Given Tolerable Error Probability, Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-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, The asymptotic equipartition property in reinforcement learning and its relation to return maximization, On the capacity of the arbitrarily varying channel for maximum probability of error, Properties of noncommutative Rényi and Augustin information