The ELS-coder: a rapid entropy coder

Summary form only given. The ELS-coder is a new entropy-coding algorithm combining rapid encoding and decoding with near-optimum compression ratios. It can be combined with data-modeling methods to produce data-compression applications for text, images, or any type of digital data. Previous algorith...

Full description

Saved in:
Bibliographic Details
Published in:DCC (Los Alamitos, Calif.) p. 475
Main Author: Withers, D.
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 1997
Subjects:
Arithmetic
Decoding
Encoding
Entropy coding
Huffman coding
Image coding
Image converters
Measurement units
Table lookup
Transform coding
ISBN:9780818677618, 0818677619
ISSN:1068-0314
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary form only given. The ELS-coder is a new entropy-coding algorithm combining rapid encoding and decoding with near-optimum compression ratios. It can be combined with data-modeling methods to produce data-compression applications for text, images, or any type of digital data. Previous algorithms for entropy coding include Huffman coding, arithmetic coding, and the Q- and QM-coders, but all show limitations of speed or compression performance, so that new algorithms continue to be of interest. The ELS-coder, which uses no multiplication or division operations, operates more rapidly than traditional arithmetic coding. It compresses more effectively than Huffman coding (especially for a binary alphabet) and more effectively than the Q- or QM-coder except for symbol probabilities very close to zero or one.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:9780818677618
0818677619
ISSN:1068-0314
DOI:10.1109/DCC.1997.582144