DocumentCode
2743374
Title
Efficient run-length encoding of binary sources with unknown statistics
Author
Costa, Max H M ; Malvar, Henrique S.
Author_Institution
FEEC/DECOM, Univ. Estadual de Campinas, Sao Paulo, Brazil
fYear
2004
fDate
23-25 March 2004
Firstpage
534
Abstract
This paper describes an efficient run-length encoding of binary sources with unknown statistics. Binary entropy coders are used in many multimedia codec standards, which uses adaptive Golomb-Rice coders. Using a maximum-likelihood approach, an excess rate for the Golomb-like coder when compared to an adaptive Rice coder is up to 4.2% for binary sources with unknown statistics with respect to the source entropy.
Keywords
adaptive codes; binary codes; code standards; codecs; entropy codes; maximum likelihood estimation; multimedia communication; runlength codes; source coding; adaptive Golomb-Rice coder; binary entropy coder; binary source; maximum-likelihood approach; multimedia codec standard; run-length encoding; source entropy; unknown statistic; Code standards; Codecs; Data compression; Encoding; Entropy; Information theory; Notice of Violation; Polynomials; Statistics; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2004. Proceedings. DCC 2004
ISSN
1068-0314
Print_ISBN
0-7695-2082-0
Type
conf
DOI
10.1109/DCC.2004.1281510
Filename
1281510
Link To Document