By Topic

A fast on-line adaptive code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
B. Y. Ryabko ; Appl. Math. & Cybern. Novosibirsk Inst. of Commun., Russia

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(log2 n), n→∞. 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(log2 n) per letter, which is close to the lower bound O(log n)

Published in:

IEEE Transactions on Information Theory  (Volume:38 ,  Issue: 4 )