Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme

DOI10.1137/100794092zbMath1248.94045arXivcs/0205048OpenAlexW2027121869MaRDI QIDQ2910857

Neal E. Young, Claire Mathieu, Mordecai J. Golin

Publication date: 12 September 2012

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

Full work available at URL: https://arxiv.org/abs/cs/0205048

zbMATH Keywords

Huffman coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding ⋮ Generalized Huffman coding for binary trees with choosable edge lengths

This page was built for publication: Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme