A combinatorial approach to Golomb forests
From MaRDI portal
Publication:5941521
DOI10.1016/S0304-3975(00)00250-4zbMath0974.68055MaRDI QIDQ5941521
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- On optimal nested group testing algorithms
- Code and parse trees for lossless source encoding
- Huffman-type codes for infinite source distributions
- A Dichotomous Search for a Geometric Random Variable
- Optimal source codes for geometrically distributed integer alphabets (Corresp.)
- Optimal source coding for a class of integer alphabets (Corresp.)
- Existence of optimal prefix codes for infinite source alphabets
- Optimal prefix codes for sources with two-sided geometric distributions
- On Finding a Single Defective in Binomial Group Testing
- Huffman coding with an infinite alphabet
- A Method for the Construction of Minimum-Redundancy Codes
- Run-length encodings (Corresp.)
This page was built for publication: A combinatorial approach to Golomb forests
