Efficient Generation of Optimal Prefix Code

DOI10.1145/321879.321883zbMATH Open0301.68058OpenAlexW2094396702MaRDI QIDQ4055195FDOQ4055195

Author name not available (Why is that?)

Publication date: 1975

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321879.321883

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)

Cited In (3)

• Prefix codes: Equiprobable words, unequal letter costs
• A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
• Operations research applications of dichotomous search

This page was built for publication: Efficient Generation of Optimal Prefix Code

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