[go: up one dir, main page]

Mohammadi et al., 2012 - Google Patents

A criticism of the ACW algorithm

Mohammadi et al., 2012

View HTML
Document ID
16020103171172603608
Author
Mohammadi M
Naserasadi A
Publication year
Publication venue
Computers & Mathematics with Applications

External Links

Snippet

Data compression via the Huffman algorithm, which is a data compression technique, is the most efficient technique between single symbol data compression techniques. This algorithm is counted among statistical data compression techniques. Many efforts have been …
Continue reading at www.sciencedirect.com (HTML) (other versions)

Classifications

    • 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
    • H03M13/11—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 using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • 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/4031—Fixed length to variable length coding
    • H03M7/4037—Prefix coding
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators

Similar Documents

Publication Publication Date Title
Ferragina et al. Boosting textual compression in optimal linear time
US11722148B2 (en) Systems and methods of data compression
JP2002533005A (en) Codebook construction for variable-length to variable-length entropy coding
Nagaraj et al. Arithmetic coding as a non-linear dynamical system
Al-Bahadili A novel lossless data compression scheme based on the error correcting Hamming codes
Al-Bahadili et al. An adaptive character wordlength algorithm for data compression
Schulte et al. Divergence scaling of fixed-length, binary-output, one-to-one distribution matching
Tutuncu et al. New approach in e-mail based text steganography
Mohammadi et al. A criticism of the ACW algorithm
Elabdalla et al. An efficient bitwise Huffman coding technique based on source mapping
Patel et al. Survey of lossless data compression algorithms
Sethi et al. Data compression techniques
Hameed et al. A new lossless method of Huffman coding for text data compression and decompression process with FPGA implementation
Lemos‐Neto et al. Cyclically permutable codes specified by roots of generator polynomial
Singla et al. Data compression modelling: Huffman and Arithmetic
Habib et al. An Efficient Compression Technique Using Arithmetic Coding
Nagaraj A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes
El-Shora et al. PERFORMANCE EVALUATION OF DATA COMPRESSION TECHNIQUES VERSUS DIFFERENT TYPES OF DATA
Lovén Data Compression in a Vehicular Environment
Omer et al. Arabic short text compression
Rani et al. An Enhanced Text Compression System Based on ASCII Values and Huffman Coding
Klein et al. Selective dynamic compression
Höglund Lightweight Real-Time Lossless Software Compression of Trace Data
PM N Survey on lossless dictionary based datacompression algorithms
Hussain et al. Optimized Compression and Decompression Software