Precise average redundancy of an idealized arithmetic coding

Data Compression Conference Proceedings

Volumn 2002-January, Issue , 2002, Pages 222-231

  Drmota, M ^a   Hwang, Hsien Kuei ^b   Szpankowski, W ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

^c Purdue University   (United States)

Author keywords

Arithmetic; Character generation; Data compression

Indexed keywords

CODES (SYMBOLS); DIGITAL ARITHMETIC; FOURIER SERIES; OPTIMAL SYSTEMS; REDUNDANCY;

ARITHMETIC CODING; ARITHMETIC ENCODER; AVERAGE REDUNDANCIES; CHARACTER GENERATION; CONTEXT TREE WEIGHTING; FINITE PRECISION; LENGTH CONSTRAINTS; MEMORYLESS SOURCE;

DATA COMPRESSION;

EID: 84948427177     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999960     Document Type: Conference Paper

References (17)

1. A. Barron, J. Rissanen, and B. Yu, The Minimum Description Length Principle in Coding and Modeling, IEEE Trans. Information Theory, 44, 2743-2760, 1998.
2. T. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, New York 1991.
3. M. Drmota and R. Tichy,Sequences, Discrepancies, and Applications, Springer, Berlin Heidelberg 1997
4. M. Drmota and W. Szpankowski, Generalized Shannon Code Minimizes the Maximal Redundancy, Proc. LATIN'02, Cancun, Mexico, 2002.
5. J. Gibson, T. Berger, T. Lookabaugh, R. Baker Multimedia Compression: Applications & Standards, Morgan Kaufmann Publishers 1998.
6. P. Howard and J. Vitter, Analysis of Arithmetic Coding for Data Compression, Brown University, Department of Computer Science, Proc. Data Compression Conference, 3-12, Snowbird 1991.
7. R. Krichevsky and V. Trofimov, The Performance of Universal Coding, IEEE Trans. Information Theory, 27, 199-207, 1981.
8. L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences. John Wiley & Sons, New York 1974.
9. G. Louchard and W. Szpankowski, On the Average Redundancy Rate of the Lempel-Ziv Code, IEEE Trans. Information Theory, 43, 2-8, 1997.
10. J. Rissanen, Complexity of Strings in the Class of Markov Sources, IEEE Trans. Information Theory, 30, 526-532, 1984.
11. B. Ryabko, and A.N. Fionov, An Efficient Method for Adaptive Arithmetic Coding of Sources with Large Alphabets, Problems of Information Transmission, 35, 95-108, 1999.
12. S. Savari, Redundancy of the Lempel-Ziv Incremental Parsing Rule,IEEE Trans. Information Theory, 43, 9-21, 1997.
13. Y. Shtarkov, Universal Sequential Coding of Single Messages, Problems of Information Transmission, 23, 175-186, 1987.
14. W. Szpankowski, Asymptotic Redundancy of Huffman (and Other) Block Codes, IEEE Trans. Information Theory, 46, 2434-2443, 2000.
15. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, John Wiley & Sons, New York, 2001.
16. F.M. Willems, Y. Shtarkovand T. Tjalkens, The Context-Tree Weighting Method: Basic Properties, IEEE Trans. Information Theory, 41, 653-664, 1995.
17. J. Ziv, Back from Infinity: A Constrained Resources Approach to Information Theory, IEEE Information Theory Society Newsletter, 48, 30-33, 1998.