Data compression

DOI10.1145/45072.45074zbMath0647.94002OpenAlexW2295528854MaRDI QIDQ3792615

Debra A. Lelewer, Daniel S. Hirschberg

Publication date: 1987

Published in: ACM Computing Surveys (Search for Journal in Brave)

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

zbMATH Keywords

surveydistributed systemstext compressionprefix codesoptimal codesfile compressionadaptive codingdata compression methodsfile storageadaptive Huffman codesminimum-redundancy codes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Source coding (94A29)

Related Items (14)

In-place calculation of minimum-redundancy codes ⋮ A fast algorithm for adaptive prefix coding ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Robust universal complete codes for transmission and compression ⋮ An efficient raster font compression for embedded systems ⋮ An adaptive character wordlength algorithm for data compression ⋮ Tree-traversing ant algorithm for term clustering based on featureless similarities ⋮ Superlinear period lengths in some subtraction games ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ A novel lossless data compression scheme based on the error correcting Hamming codes ⋮ Is Huffmann coding dead? ⋮ Efficient coding of formalized messages ⋮ Comparison of strings belonging to the same family ⋮ Invariant characterizations of fuzzy information systems under some homomorphisms based on data compression and related results

This page was built for publication: Data compression