Nothing Special   »   [go: up one dir, main page]

Yang et al., 1997 - Google Patents

On the redundancy of the fixed-database Lempel-Ziv algorithm for/spl phi/-mixing sources

Yang et al., 1997

View PDF
Document ID
17089369732387093075
Author
Yang E
Kieffer J
Publication year
Publication venue
IEEE Transactions on Information Theory

External Links

Snippet

The redundancy problem of the fixed-database Lempel-Ziv (1977) algorithm is considered. It is demonstrated that for a class of/spl phi/-mixing sources which includes Markov sources, unifilar sources, and finite-state sources as special cases, the redundancy of the fixed …
Continue reading at www.researchgate.net (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4006—Conversion to or from arithmetic code
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits

Similar Documents

Publication Publication Date Title
Goyal et al. Deepzip: Lossless data compression using recurrent neural networks
Yang et al. On the performance of data compression algorithms based upon string matching
EP0793349A2 (en) Method and apparatus for performing data compression
Wyner et al. On the role of pattern matching in information theory
Orlitsky et al. Speaking of infinity [iid strings]
Zhang et al. An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
Szpankowski Asymptotic average redundancy of Huffman (and other) block codes
US20040117714A1 (en) Method and arrangement for arithmetic encoding and decoding binary states and a corresponding computer program and a corresponding computer-readable storage medium
US5594435A (en) Permutation-based data compression
US5808572A (en) Method and apparatus for finite-length arithmetic coding
Yang et al. On the redundancy of the fixed-database Lempel-Ziv algorithm for/spl phi/-mixing sources
Wyner The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
WO2001063772A1 (en) Method and apparatus for optimized lossless compression using a plurality of coders
Yang et al. Universal lossless data compression with side information by using a conditional MPM grammar transform
Lefebvre et al. Compror: on-line lossless data compression with a factor oracle
Bell et al. The relationship between greedy parsing and symbolwise text compression
Mathpal et al. A research paper on lossless data compression techniques
Foster et al. Universal codes for finite sequences of integers drawn from a monotone distribution
Seroussi On universal types
Jou et al. A fast and efficient lossless data-compression method
Shields Performance of LZ algorithms on individual sequences
KR100462789B1 (en) method and apparatus for multi-symbol data compression using a binary arithmetic coder
Visweswariah et al. Universal variable-to-fixed length source codes
Tank Implementation of Lempel-ZIV algorithm for lossless compression using VHDL
Kieffer et al. Structured grammar-based codes for universal lossless data compression