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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    An Efficient Variable-Length Data-Compression Scheme


    Contributors:

    Published in:

    Publication date :

    1996-01-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English






    BTC Image Compression with Variable Length Integer Codes

    Domnic, S. / Visual Information Engineering Network (Institution of Engineering and Technology) | British Library Conference Proceedings | 2006


    Data-storage compression scheme

    Salomon, P. M. / Schmidt, L. F. | NTRS | 1976


    Memory-efficient spatial prediction image compression scheme

    Nandi, A. V. / Patnaik, L. M. / Banakar, R. M. | British Library Online Contents | 2007