Code and parse trees for lossless source encoding
Author:
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 101 references indexed in Scilit:
- Complete variable-length ?fix-free? codesDesigns, Codes and Cryptography, 1995
- Characteristic inequalities for binary treesInformation Processing Letters, 1995
- An optimal bound for path weights in Huffman treesInformation Processing Letters, 1994
- Huffman codes and maximizing properties of Fibonacci numbersCybernetics and Systems Analysis, 1992
- On optimal nested group testing algorithmsJournal of Statistical Planning and Inference, 1990
- An extended result of Kleitman and Saks concerning binary treesDiscrete Applied Mathematics, 1985
- Huffman's algorithm via algebraJournal of Combinatorial Theory, Series A, 1982
- Huffman coding in bit-vector compressionInformation Processing Letters, 1978
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- On Finding a Single Defective in Binomial Group TestingJournal of the American Statistical Association, 1974