Buffer overflow in variable length coding of fixed rate sources

DOI10.1109/TIT.1968.1054147MaRDI QIDQ5546454zbMATH OpenFDO

Authors Frederick Jelinek

Publication date 1968

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

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• On overflow and underflow problems in buffer-instrumented variable-length coding of fixed- rate memoryless sources (Corresp.)
• Universal coding with minimum probability of codeword length overflow
• Sequential Decoding - The Computation Problem*
• Weak variable-length source coding
• Universal variable-to-fixed length source codes

Cited in

(13)

• Some inequalities in information theory using Tsallis entropy
• A joint representation of Rényi's and Tsalli's entropy with application in coding theory
• Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order and type
• A class of measures of informativity of observation channels
• Universal coding with minimum probability of codeword length overflow
• Search with noisy and delayed response
• ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC
• On overflow and underflow problems in buffer-instrumented variable-length coding of fixed- rate memoryless sources (Corresp.)
• Frame permutation quantization
• Coding theorem based on \(\lambda\)-norm entropy for partitions in product MV-algebras
• Rényi divergence in hidden Markov models
• A toolbox for refined information-theoretic analyses
• Buffer overflow period in a MAP queue

This page was built for publication: Buffer overflow in variable length coding of fixed rate sources

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