Adaptive variable-length coding scheme for compression of stream of independent and identically distributed source data involves either Huffman code or alternating run-length Huffman (ARH) code, depending on characteristics of data. Enables efficient compression of output of lossless or lossy precompression process, with speed and simplicity greater than those of older coding schemes developed for same purpose. In addition, scheme suitable for parallel implementation on hardware with modular structure, provides for rapid adaptation to changing data source, compatible with block orientation to alleviate memory requirements, ensures efficiency over wide range of entropy, and easily combined with such other communication schemes as those for containment of errors and for packetization.
An Efficient Variable-Length Data-Compression Scheme
NASA Tech Briefs ; 20 , 1
01.01.1996
Sonstige
Keine Angabe
Englisch
An Efficient Variable-Length Data-Compression Scheme
Online Contents | 1996
BTC Image Compression with Variable Length Integer Codes
British Library Conference Proceedings | 2006
|Data-storage compression scheme
NTRS | 1976
|Memory-efficient spatial prediction image compression scheme
British Library Online Contents | 2007
|