Title

A Multi-Group Technique For Data Compression

Keywords

Binary trees; Character distribution; Coding techniques; Compression efficiency; Data compression; Entropy; Failure node; Locality of character reference

Abstract

An efficient compression technique that is particularly attractive for the storage of large commercial files and the transfer of such files within a distributed communication network is outlined. The technique, constructed as a two-level hierarchy of Huffman-type binary trees, is a reversible semantic-independent variable-length character encoding method that makes use of the group locality of character reference behavior and the variable frequency of occurrence of various characters within the different subgroupings of the character set The compression efficiency and cost of the Multi-Group scheme has been found to be superior to the well-known Huffman encoding algorithm.

Publication Date

6-2-1982

Publication Title

Proceedings of the ACM SIGMOD International Conference on Management of Data

Number of Pages

284-292

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1145/582353.582406

Socpus ID

84982421687 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84982421687

This document is currently not available here.

Share

COinS