On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths

DOI10.1109/TIT.2004.840858MaRDI QIDQ3546878zbMATH OpenOpenAlexFDO

Authors Enrique Figueroa-Lopez, Christian Houdré

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2004.840858

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• Asymptotic average redundancy of Huffman (and other) block codes
• On the redundancy of lossy source coding with abstract alphabets
• Pointwise redundancy in lossy data compression and universal lossy data compression
• The redundancy of source coding with a fidelity criterion. 1. Known statistics

Cited in

(1)

• On the redundancy of lossy source coding with abstract alphabets

This page was built for publication: On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths

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