Turpin et al., 2002 - Google Patents

Housekeeping for prefix coding

Turpin et al., 2002

Document ID: 12213749412260570757
Author: Turpin A; Moffat A
Publication year: 2002
Publication venue: IEEE Transactions on Communications

External Links

Cited by

Snippet

We consider the problem of constructing and transmitting the prelude for Huffman (1952) coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when S …

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/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/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
- 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/46—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind
- 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/14—Conversion to or from non-weighted codes
- 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/02—Conversion to or from weighted codes, i.e. the weight given to a digit depending on the position of the digit within the block or code word
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M5/00—Conversion of the form of the representation of individual digits
- H03M5/02—Conversion to or from representation by pulses
- H03M5/04—Conversion to or from representation by pulses the pulses having two levels
- H03M5/14—Code representation, e.g. transition, for a given bit cell depending on the information in one or more adjacent bit cells, e.g. delay modulation code, double density code
- H03M5/145—Conversion to or from block codes or representations thereof

Similar Documents

Publication	Publication Date	Title
Shanmugasundaram et al.	2011	A comparative study of text compression algorithms
Kosaraju et al.	2000	Compression of low entropy strings with Lempel--Ziv algorithms
Fenwick	1996	The Burrows–Wheeler transform for block sorting text compression: principles and improvements
Manzini	2001	An analysis of the Burrows—Wheeler transform
Deorowicz	2002	Second step algorithms in the Burrows–Wheeler compression algorithm
Balkenhol et al.	2002	Universal data compression based on the Burrows-Wheeler transformation: Theory and practice
EP0438956A1 (en)	1991-07-31	Method of encoding compressed data
Turpin et al.	2002	Housekeeping for prefix coding
Anisimov et al.	2017	Variable-length prefix codes with multiple delimiters
Massey	1994	Some applications of source coding in cryptography
Said et al.	2003	Arithmetic coding
Bell et al.	1994	The relationship between greedy parsing and symbolwise text compression
EP0435802B1 (en)	1995-08-23	Method of decompressing compressed data
Moffat et al.	1997	Lossless compression for text and images
US5010344A (en)	1991-04-23	Method of decoding compressed data
Lin	2000	A hardware architecture for the LZW compression and decompression algorithms based on parallel dictionaries
Haque et al.	2017	Study on data compression technique
Robert et al.	2009	Simple lossless preprocessing algorithms for text compression
Shanmugasundaram et al.	2011	IIDBE: A lossless text transform for better compression
Nithya et al.	2023	The Study of Text Compression Algorithms and their Efficiencies Under Different Types of Files
Somasundaram et al.	2007	Extended golomb code for integer representation
Senthil et al.	2011	Text compression algorithms: A comparative study
Arif et al.	2009	An enhanced static data compression scheme of Bengali short message
Fenwick	1995	Experiments with a block sorting text compression algorithm
Jaradat et al.	2001	A Simple Binary Run‐Length Compression Technique for Non‐Binary Sources Based on Source Mapping