Lower bound for ensemble-average error probability for a discrete memoryless channel

MaRDI QIDQ1148859zbMATH OpenFDO

Authors Arkadii G. D'yachkov

Publication date 1980

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

Full work available at URL http://mathnet.ru/eng/ppi/v16/i2/p18

zbMATH Keywords

asymptotic bound

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• Lower bound on error probability in fixed-volume list decoding
• Error probability exponent of list decoding at low rates
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Lower bound for error probability in a discrete memoryless channel with feedback
• scientific article; zbMATH DE number 4010386

Cited in

(8)

• Lower bound on error probability in fixed-volume list decoding
• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
• Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
• scientific article; zbMATH DE number 4010386 (Why is no real title available?)
• scientific article; zbMATH DE number 3294106 (Why is no real title available?)
• scientific article; zbMATH DE number 3405822 (Why is no real title available?)
• Lower bound for error probability in a discrete memoryless channel with feedback

This page was built for publication: Lower bound for ensemble-average error probability for a discrete memoryless channel

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