See this document in CiteSeerX!

Arithmetic Coding for Data Compression (1994)  (Make Corrections)  (27 citations)
Paul G. Howard, Jeffrey Scott Vitter



  Home/Search   Context   Related

 
View or download:
duke.edu/pub/dist/techre...199409.ps.Z
duke.edu/~jsv/Pape...metic_coding.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  duke.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: .23> , en , and an accurate assessment of the probability distribution P of the events, Shannon [1] proved that the the smallest possible expected number of bits needed to encode an event is the entropy of P , denoted by H(P ) = n X k=1 \Gammapfe k g log 2 pfekg; where pfekg is the probability that event ek occurs. An optimal code outputs \Gamma log 2 p bits to encode an event whose probability of occurrence is p. Pure arithmetic codes supplied with accurate probabilities provides optimal... (Update)

Cited by:   More
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 15, NO. 2.. - Image Distribution..   (Correct)
US Patent Pending - Modified Embedded Zerotree   (Correct)
PPM Model Cleaning - Drinic, Kirovski, Potkonjak (2003)   (Correct)

Similar documents (at the sentence level):
21.9%:   The Design and Analysis of Efficient Lossless Data Compression.. - Howard (1993)   (Correct)
6.2%:   Practical Implementations of Arithmetic Coding - Howard, Vitter (1992)   (Correct)

Active bibliography (related documents):   More   All
0.4:   On-Line Stochastic Processes in Data Compression - Bunton (1996)   (Correct)
0.3:   Lossless Compression for Text and Images - Moffat, Bell, Witten (1995)   (Correct)
0.3:   Random Access Decompression using Binary Arithmetic Coding - Lekatsas, Wolf (1999)   (Correct)

Similar documents based on text:   More   All
1.0:   Fast and Efficient Lossless Image Compression - Howard, Vitter (1993)   (Correct)
0.7:   Error Modeling for Hierarchical Lossless Image Compression - Howard, Vitter (1995)   (Correct)
0.3:   Arithmetic Coding with Folds and Unfolds - Bird, Gibbons (2003)   (Correct)

Related documents from co-citation:   More   All
12:   Arithmetic Coding for Data Compression (context) - Witten, Neal et al.
4:   Embedded image coding using zerotrees of wavelet coefficients - Shapiro - 1993
4:   A mathematical theory of communication (context) - Shannon - 1948

BibTeX entry:   (Update)

P. G. Howard and J. S. Vitter, "Arithmetic coding for data compression," Proc. of the IEEE, Vol. 82, No. 6, pp. 857-865, June 1994. http://citeseer.ist.psu.edu/howard94arithmetic.html   More

@techreport{ howard94arithmetic,
    author = "Paul G. Howard and Jeffery Scott Vitter",
    title = "Arithmetic Coding for Data Compression",
    number = "Technical report DUKE--TR--1994--09",
    year = "1994",
    url = "citeseer.ist.psu.edu/howard94arithmetic.html" }
Citations (may not include all citations):
1447   A Mathematical Theory of Communication (context) - Shannon - 1948
458   A Universal Algorithm for Sequential Data Compression - Ziv, Lempel - 1977
368   Text Compression (context) - Bell, Cleary et al. - 1990
344   Arithmetic Coding for Data Compression (context) - Witten, Neal et al. - 1987
338   A Method for the Construction of Minimum RedundancyCodes (context) - Huffman - 1952
148   Data Compression Using Adaptive Coding and Partial String Ma.. - Cleary, Witten - 1984
137   Universal Codeword Sets and Representations of Integers (context) - Elias - 1975
95   The Zero Frequency Problem: Estimating the Probabilities of .. (context) - Witten, Bell - 1991
60   Run-LengthEncodings (context) - Golomb - 1966
50   An Overview of the Basic Principles of the Q-Coder Adaptive .. (context) - Pennebaker, Mitchell et al. - 1988
47   Arithmetic Coding (context) - Rissanen, Langdon - 1979
33   Optimal Computer-Search Trees and Variable-Length Alphabetic.. (context) - Hu, Tucker - 1971
32   Generalized Kraft Inequality and Arithmetic Coding (context) - Rissanen - 1976
28   Some Practical Universal Noiseless Coding Techniques (context) - Rice - 1979
27   Analysis of Arithmetic Coding for Data Compression - Howard, Vitter - 1992
23   Practical Implementations of Arithmetic Coding - Howard, Vitter - 1992
22   Source Coding Algorithms for Fast Data Compression (context) - Pasco - 1976
20   Application of Splay Trees to Data Compression (context) - Jones - 1988
15   Arithmetic Stream Coding Using Fixed Precision Registers (context) - Rubin - 1979
9   An Empirical Evaluation of Coding Methods for Multi-Symbol A.. (context) - Moffat, Sharman et al. - 1993
9   A General Minimum-Redundancy Source-Coding Algorithm (context) - Guazzo - 1980
9   IEEE Trans (context) - Individual, Variable et al. - 1978
4   Fast Arithmetic Coding Using Low-Precision Division (context) - Neal - 1987



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html):   More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994)   (Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994)   (Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC