Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions

@article{Ryabko2003FastAA,
  title={Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions},
  author={Boris Ryabko and Jorma Rissanen},
  journal={IEEE Communications Letters},
  year={2003},
  volume={7},
  pages={33-35}
}
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 needed for encoding and decoding is equal to clogr+c/sub 1/ instead of clogN+c/sub 2/ as in previous arithmetic codes, c, c/sub 1/, c/sub 2/ are constants. When r is small relative to N-which is the… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A fast sequential code

  • B. Y. Ryabko
  • (in Russian),
  • 1989
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…