On the lexicographical generation of compressed codes
From MaRDI portal
Publication:2380004
DOI10.1016/j.ipl.2007.05.011zbMath1184.68325OpenAlexW2026760016MaRDI QIDQ2380004
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.011
Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Cites Work
- Lexicographic generation of ordered trees
- The expected additive weight of trees
- Linear probing and graphs
- Uniform random generation of decomposable structures using floating-point arithmetic
- Generating words lexicographically: An average-case analysis
- On the Altitude of Nodes in Random Trees
- Random generation of colored trees
- Boltzmann Sampling of Unlabelled Structures
- Mathematical Foundations of Computer Science 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item