Random coding bounds for discrete memoryless channels

MaRDI QIDQ1168948zbMATH OpenFDO

Authors G. Sh. Poltyrev

Publication date 1982

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/ppi/v18/i1/p12

Mathematics Subject Classification ID

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

Recommendations

• Random-coding bounds for some broadcast channels
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Random coding techniques for nonrandom codes
• Random coding bound for E-capacity of DMC with stochastic encoding
• scientific article; zbMATH DE number 3670354

Cited in

(14)

• Random-coding bounds for some broadcast channels
• The Augustin capacity and center
• The sphere packing bound for memoryless channels
• Bounds on the rate of disjunctive codes
• Random coding bound for E-capacity of DMC with stochastic encoding
• The Minimum Average Code for Finite Memoryless Monotone Sources
• A direct proof of the coding theorem for discrete sources with memory
• On the method of random coding
• Transmission of a Bit Over a Discrete Poisson Channel With Memory
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• On the coding theorem and its converse for finite-memory channels
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• A toolbox for refined information-theoretic analyses

This page was built for publication: Random coding bounds for discrete memoryless channels

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