A fast on-line adaptive code

There are two classes of data compression algorithms. One class has redundancy log log n+O(1), where n is the alphabet size, and an encoding time O(log/sup 2/ n), n to infinity . The other has redundancy O(1) and an encoding time O(n). A code is presented combining advantages of both classes of comp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1992-07, Vol.38 (4), p.1400-1404
Main Author: Ryabko, B.Y.
Format: Article
Language:English
Subjects:
Adaptive coding
Applied sciences
Binary codes
Coding, codes
Error correction
Error correction codes
Exact sciences and technology
Indium tin oxide
Information, signal and communications theory
Signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:There are two classes of data compression algorithms. One class has redundancy log log n+O(1), where n is the alphabet size, and an encoding time O(log/sup 2/ n), n to infinity . The other has redundancy O(1) and an encoding time O(n). A code is presented combining advantages of both classes of compression methods: its redundancy is O(1) and the encoding and decoding time is O(log/sup 2/ n) per letter, which is close to the lower bound O(log n).< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.144725