In-place calculation of minimum-redundancy codes

DOI10.1007/3-540-60220-8_79zbMATH Open1502.68120OpenAlexW1585125654MaRDI QIDQ5057451FDOQ5057451

Authors: Alistair Moffat, Jyrki Katajainen 

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_79

Recommendations

• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• Efficient construction of minimum-redundancy codes for large alphabets
• A fast and space-economical algorithm for length-limited coding
• Optimal prefix free codes with partial sorting
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes

zbMATH Keywords

data compressionHuffman codein-place algorithmprefix-free code

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data compression
• In-place linear probing sort
• Constructing Huffman Trees in Parallel

Cited In (7)

• A fast algorithm for optimal length-limited Huffman codes
• Dynamic huffman coding
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
• A fast and space-economical algorithm for length-limited coding
• Huffman coding with non-sorted frequencies
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct
• Optimal prefix free codes with partial sorting

This page was built for publication: In-place calculation of minimum-redundancy codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057451)