Compressing probability distributions
Author:
- 1 February 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 97 (4) , 133-137
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Approximate discrete probability distribution representation using a multi-resolution binary tree2004
- Optimal alphabet partitioning for semi-adaptive coding of sources of unknown sparse distributions2003
- On binary alphabetical codes2003
- Protocols for Asymmetric Communication ChannelsJournal of Computer and System Sciences, 2001
- Succinct Representation of Balanced Parentheses and Static TreesSIAM Journal on Computing, 2001
- Upper and Lower Bounds on Constructing Alphabetic Binary TreesSIAM Journal on Discrete Mathematics, 1995
- An application of informational divergence to Huffman codesIEEE Transactions on Information Theory, 1982
- A Best Possible Bound for The Weighted Path Length of Binary Search TreesSIAM Journal on Computing, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951