Efficient and compact representations of some non-canonical prefix-free codes
From MaRDI portal
Publication:5918490
DOI10.1016/j.tcs.2022.01.010OpenAlexW4226238874MaRDI QIDQ5918490
Gonzalo Navarro, Giovanni Manzini, Alberto Ordóñez, Travis Gagie, Antonio Fariña, Szymon Grabowski
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.06615
Cites Work
- Unnamed Item
- Tight bounds for online stable sorting
- Optimal alphabetic search trees with restricted maximal height
- Wavelet trees for all
- Compressed data structures: Dictionaries and data-aware measures
- Succinct Representation of Balanced Parentheses and Static Trees
- Time-space trade-offs for predecessor search
- Efficient and Compact Representations of Prefix Codes
- Worst-Case Optimal Adaptive Prefix Coding
- Boosting textual compression in optimal linear time
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- Optimal Alphabetic Trees
- Restructuring ordered binary trees
- Optimal Lower and Upper Bounds for Representing Sequences
- Dynamic Trees with Almost-Optimal Access Cost
- Generating a canonical prefix encoding
- Algorithms – ESA 2004
- Elements of Information Theory
- A Method for the Construction of Minimum-Redundancy Codes
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Efficient and compact representations of some non-canonical prefix-free codes
This page was built for publication: Efficient and compact representations of some non-canonical prefix-free codes
