Three space-economical algorithms for calculating minimum-redundancy prefix codes
DOI10.1109/18.945242zbMATH Open1016.94019OpenAlexW2083324355MaRDI QIDQ4544663FDOQ4544663
Authors: Artur Alves Pessoa, Ruy L. Milidiú, Eduardo S. Laber 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.945242
Recommendations
- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
- Efficient construction of minimum-redundancy codes for large alphabets
- Efficient and Compact Representations of Prefix Codes
- A fast and space-economical algorithm for length-limited coding
- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
- Faster algorithm for designing optimal prefix-free codes with unequal letter costs
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- scientific article; zbMATH DE number 1782271
- Bounding the inefficiency of length-restricted prefix codes
- On the proportion of prefix codes in the set of three-element codes
Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (7)
- In-place calculation of minimum-redundancy codes
- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
- Minimum Delay Codes
- A fast and space-economical algorithm for length-limited coding
- Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Title not available (Why is that?)
This page was built for publication: Three space-economical algorithms for calculating minimum-redundancy prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544663)
