Huffman code efficiencies for extensions of sources

DOI10.1109/26.380027zbMATH Open0986.94504OpenAlexW2145684344MaRDI QIDQ2726547

P. M. Fenwick

Publication date: 13 June 2002

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ee228f0c6c54fca04b0d0e8f503a95893cce54f0

zbMATH Keywords

extensions of sourcesHuffman coding treesource probabilities

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29) Synchronization error-correcting codes (94B50)

Related Items (1)

An efficient bitwise Huffman coding technique based on source mapping.

This page was built for publication: Huffman code efficiencies for extensions of sources

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