[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Schmidhuber et al., 1994 - Google Patents

Predictive coding with neural nets: Application to text compression

Schmidhuber et al., 1994

View PDF
Document ID
7652037535433467385
Author
Schmidhuber J
Heil S
Publication year
Publication venue
Advances in neural information processing systems

External Links

Snippet

To compress text files, a neural predictor network P is used to ap (cid: 173) proximate the conditional probability distribution of possible" next characters", given n previous characters. P's outputs are fed into standard coding algorithms that generate short codes for characters …
Continue reading at proceedings.neurips.cc (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/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3088—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing the use of a dictionary, e.g. LZ78
    • 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
    • H03M7/3086—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing a sliding window, e.g. LZ77

Similar Documents

Publication Publication Date Title
Schmidhuber et al. Sequential neural text compression
US5945933A (en) Adaptive packet compression apparatus and method
US5959560A (en) Data compression via alphabet partitioning and group partitioning
US6100825A (en) Cluster-based data compression system and method
Schmidhuber et al. Predictive coding with neural nets: Application to text compression
Abel Improvements to the Burrows-Wheeler compression algorithm: After BWT stages
Drmota et al. Redundancy of lossless data compression for known sources by analytic methods
Elabdalla et al. An efficient bitwise Huffman coding technique based on source mapping
Al-Bahadili et al. A bit-level text compression scheme based on the ACW algorithm
Yang et al. On the redundancy of the fixed-database Lempel-Ziv algorithm for/spl phi/-mixing sources
urgen Schmidhuber et al. PREDICTIVE CODING WITH NEURAL NETS: APPLICATION TO TEXT COMPRESSION
Jain et al. A comparative study of lossless compression algorithm on text data
Hoang et al. Dictionary selection using partial matching
urgen Schmidhuber et al. COMPRESSING TEXTS WITH NEURAL NETS
US7564383B2 (en) Compression ratio of adaptive compression algorithms
Stefo et al. FPGA-Based modelling unit for high speed lossless arithmetic coding
Iwata et al. An efficient universal coding algorithm for noiseless channel with symbols of unequal cost
Al-Bahadili et al. A bit-level text compression scheme based on the HCDC algorithm
Punthong et al. A Novel Approach for On-line Encoding Algorithm Using A Generating Function
Venkatesh et al. Modified Arithmetic Coding to Increase the Compression Rate of Text Data
Ramaswamy et al. Context modeling of wavelet coefficients in EZW-based lossless image coding
Hoang et al. Multiple-dictionary compression using partial matching
Blumer Applications of DAWGs to data compression
Kho et al. Application of Data Compression Technique in Congested Networks
Im et al. Optimal Universal Lossless Compression with Side Information