RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 1999, Volume 35, Issue 4, Pages 95–108 (Mi ppi465)  

This article is cited in 6 scientific papers (total in 6 papers)

Source Coding

Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets

B. Ya. Ryabko, A. N. Fionov


Abstract: We consider the problem of constructing an adaptive arithmetic code for the case of a large source alphabet. We propose a method with encoding/decoding time, which is an order less than that for known methods. We also propose an implementation of the method with the use of a data structure called an “imaginary sliding window,” which makes it possible to essentially decrease the encoder/decoder memory capacity.

Full text: PDF file (1655 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 1999, 35:4, 369–380

Bibliographic databases:
UDC: 621.391.15
Received: 18.01.1999

Citation: B. Ya. Ryabko, A. N. Fionov, “Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets”, Probl. Peredachi Inf., 35:4 (1999), 95–108; Problems Inform. Transmission, 35:4 (1999), 369–380

Citation in format AMSBIB
\Bibitem{RyaFio99}
\by B.~Ya.~Ryabko, A.~N.~Fionov
\paper Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets
\jour Probl. Peredachi Inf.
\yr 1999
\vol 35
\issue 4
\pages 95--108
\mathnet{http://mi.mathnet.ru/ppi465}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1737750}
\zmath{https://zbmath.org/?q=an:0984.94038}
\transl
\jour Problems Inform. Transmission
\yr 1999
\vol 35
\issue 4
\pages 369--380


Linking options:
  • http://mi.mathnet.ru/eng/ppi465
  • http://mi.mathnet.ru/eng/ppi/v35/i4/p95

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Yang, EH, “Universal lossless data compression with side information by using a conditional MPM grammar transform”, IEEE Transactions on Information Theory, 47:6 (2001), 2130  crossref  mathscinet  zmath  isi
    2. B. Ya. Ryabko, E. P. Machikina, “An Efficient Generation Method for Uniformly Distributed Random Numbers”, Problems Inform. Transmission, 38:1 (2002), 20–25  mathnet  crossref  mathscinet  zmath
    3. Krivoulets A., “On redundancy of coding using binary tree decomposition”, Proceedings of 2002 IEEE Information Theory Workshop, 2002, 200–200  crossref  isi
    4. Drmota M., Hwang H.K., Szpankowski W., “Precise average redundancy of an idealized arithmetic coding”, Dcc 2002: Data Compression Conference, Proceedings, IEEE Data Compression Conference, 2002, 222–231  isi
    5. Liebchen T., Reznik Y.A., “MPEG-4 ALS: an emerging standard for lossless audio coding”, Dcc 2004: Data Compression Conference, Proceedings, IEEE Data Compression Conference, 2004, 439–448  isi
    6. Reznik Y.A., “Coding of prediction residual in MPEG-4 standard for lossless audio coding (MPEG-4 ALS)”, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004, 1024–1027  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:913
    Full text:313
    References:59
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020