Efficient run-length encoding of binary sources with unknown statistics

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.

[1]  Erik Ordentlich,et al.  A low-complexity modeling approach for embedded coding of wavelet coefficients , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[2]  Heiko Schwarz,et al.  Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[3]  Shigenori Kino,et al.  Bi-level image coding with MELCODE-comparison of block type code and arithmetic type code , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[4]  David C. van Voorhis,et al.  Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[5]  S. Golomb.  Run-length encodings. , 1966 .

[6]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[7]  Guillermo Sapiro,et al.  The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS , 2000, IEEE Trans. Image Process..

[8]  Alberto Leon-Garcia,et al.  Efficient run-length encodings , 1982, IEEE Trans. Inf. Theory.

[9]  Jukka Teuhola,et al.  A Compression Method for Clustered Bit-Vectors , 1978, Inf. Process. Lett..

[10]  A. Gualtierotti.  H. L. Van Trees, Detection, Estimation, and Modulation Theory, , 1976 .

[11]  Robert F. Rice,et al.  Some practical universal noiseless coding techniques , 1979 .

[12]  Henrique S. Malvar.  Fast adaptive encoder for bi-level images , 2001, Proceedings DCC 2001. Data Compression Conference.