Prefix Codes: Equiprobable Words, Unequal Letter Costs

DOI10.1137/S0097539794268388zbMath0876.68053OpenAlexW3102640600MaRDI QIDQ5691295

Neal E. Young, Mordecai J. Golin

Publication date: 18 November 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794268388

zbMATH Keywords

Huffman coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Related Items (1)

A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs

This page was built for publication: Prefix Codes: Equiprobable Words, Unequal Letter Costs