By Topic

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions

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
$31 $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

2 Author(s)
Ryabko, B. ; Siberian State Univ. of Telecommun. & Comput. Sci., Novosibirsk, Russia ; Rissanen, J.

We address the problem of constructing an adaptive arithmetic code in the case where the source alphabet is large and there are lots of different symbols with equal counts of occurrence. For an alphabet of N symbols and r distinct symbol weights we describe a code for which the number of operations of encoding and decoding is equal to c log r + c1 instead of c log N + c2 as in previous arithmetic codes, c, c1, c2 are constants. When r is small relative to N - which is the case for most practical coding problems on large alphabets - the encoding and decoding speed of the suggested code will be substantially greater than with known methods.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002