Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels

DOI10.1109/TIT.2013.2276893MaRDI QIDQ5346261zbMATH OpenFDO

Authors Poning Chen, Hsuan-Yin Lin, Stefan M. Moser

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2013.2276893

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05)

Cited in

(2)

• Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels

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