Huffman coding in bit-vector compression

DOI10.1016/0020-0190(78)90023-6zbMath0385.94018OpenAlexW2032296381MaRDI QIDQ1249555

K. Appert

Publication date: 1978

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90023-6

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (6)

An efficient finite-state machine implementation of Huffman decoders ⋮ The use and usefulness of numeration systems ⋮ Robust universal complete codes for transmission and compression ⋮ Is Huffmann coding dead? ⋮ Text compression methods ⋮ Adaptive succinctness

Cites Work

• Unnamed Item

This page was built for publication: Huffman coding in bit-vector compression