The Minimum Average Code for Finite Memoryless Monotone Sources

DOI10.1109/TIT.2006.890782MaRDI QIDQ3548216zbMATH OpenFDO

Authors Hossein Saidi, T. Aaron Gulliver, Mohammadali Khosravifard, Morteza Esmaeili

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.2006.890782

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Bounding the Average Length of Optimal Source Codes Via Majorization Theory
• On the coding theorem and its converse for finite-memory channels
• Lower bounds on the minimum average distance of binary codes
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• Random coding bounds for discrete memoryless channels
• Source coding for average rate and average distortion: New variable-length coding theorems
• On the minimum average distance of binary constant weight codes
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
• Source coding exponents for zero-delay coding with finite memory

Cited in

(3)

• Universal codes for finite sequences of integers drawn from a monotone distribution
• A source matching approach to finding minimax codes
• Codes with monotonic codeword lengths

This page was built for publication: The Minimum Average Code for Finite Memoryless Monotone Sources

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