A universal variable-to-fixed length source code based on Lawrence's algorithm

DOI10.1109/18.119684MaRDI QIDQ3990761zbMATH OpenOpenAlexWikidataFDO

Authors Tj. J. Tjalkens, Frans M. J. Willems

Publication date 28 June 1992

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

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

zbMATH Keywords

binary entropy functionenumerative codingLawrence algorithmredundancyuniversal binary variable-to- fixed length source codingvariable-to-fixed length codes

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Universal variable-to-fixed length source codes
• Almost Instantaneous Fixed-to-Variable Length Codes
• Variable to fixed-length codes for Markov sources
• Complete variable-length ``fix-free codes
• Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator
• A sequential algorithm for the universal coding of finite memory sources
• New coding algorithm based on variable-length codewords for piecewise uniform quantizers

This page was built for publication: A universal variable-to-fixed length source code based on Lawrence's algorithm

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