Universal coding with minimum probability of codeword length overflow

DOI10.1109/18.79912MaRDI QIDQ3358638zbMATH OpenOpenAlexFDO

Authors Neri Merhav

Publication date 1991

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

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

zbMATH Keywords

buffer overflowcompetitive optimalityfinite-alphabet sourcesfinite-state sourcesKraft inequalitylarge deviationsLempel-Ziv algorithmlength overflowLossless block-to-variable length source codingunifilar Markov sourcesuniversal noiseless coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Universal variable-to-fixed length source codes
• Buffer overflow in variable length coding of fixed rate sources
• Simplistic universal coding
• Universal noiseless coding
• Optimal universal coding with respect to the maximal individual relative redundancy criterion

Cited in

(3)

• The asymptotic equipartition property in reinforcement learning and its relation to return maximization
• On overflow and underflow problems in buffer-instrumented variable-length coding of fixed- rate memoryless sources (Corresp.)
• Buffer overflow in variable length coding of fixed rate sources

This page was built for publication: Universal coding with minimum probability of codeword length overflow

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