Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)
- 1 March 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 27 (2) , 230-232
- https://doi.org/10.1109/tit.1981.1056322
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Binary Trees Optimum Under Various CriteriaSIAM Journal on Applied Mathematics, 1979
- On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output DistributionSIAM Journal on Applied Mathematics, 1974
- On variable-length-to-block codingIEEE Transactions on Information Theory, 1972
- Buffer overflow in variable length coding of fixed rate sourcesIEEE Transactions on Information Theory, 1968
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952