Performance Analysis of Golomb Codes and Extended Gamma Codes for Arbitrary Probability Distributions

Golomb S W. Run-length encodings [J].IEEE Trans. on Info.Theory.1966, 12(3):399-[2]Weinberger M J, Seroussi G, Sapiro G. The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS [J].IEEE Trans. on Image Processing.2000, 9(8):1309-[3]Rice R F. Some practical universal noiseless coding techniquesPart Ⅲ [R]. Technical Report JPL-91-3, Jet Propulsion Laboratory,Pasadena, CA, 1991.[4]Gallager R G, Voorhis D C V. Optimal source codes for geometrically distributed integer alphabets [J].IEEE Trans. on Info. Theory.1975, 21(2):228-[5]Szpankowski W. Asymptotic average redundancy of Huffman (and other) block codes [J].IEEE Trans. on Info. Theory.2000,46(7):2434-[6]Merhav N, Seroussi G, Weinberger M J. Optimal prefix codes for sources with two-sided geometric distributions [J].IEEE Trans.on Info. Theory.2000, 46(1):121-[7]Howard P G. The design and analysis of efficient lossless data compression systems [D]. Rhode Island: Brown University, 1993.[8]Fenwick P. Punctured Elias codes for variable-length coding of the integers [R]. Technical Report 137, Dept of Computer Science,The University of Auckland, New Zealand, December 1996.[9]Elias P. Universal codeword sets and representations of the integers [J].IEEE Trans. onInfo. Theory.1975, 21(2):194-[10]Lakshmanan K B. On universal codeword sets [J].IEEE Trans. on Info. Theory.1981, 27(5):659-[11]Amemiya T, Yamamoto H. A new class of the universal representation for the positive integers [J]. IEICE Trans. on Fundamentals, 1993, E76-A(3): 447 - 452.[12]Wyner A D. An upper bound on the entropy series [J].Information and Control.1972, 20(2):176-[13]Apostolico A, Fraenkel A S. Robust transmission of unbounded strings using Fibonacci representations [J].IEEE Trans. on Info.Theory.1987, 33(2):238-[14]Wang M. Almost asymptotically optimal flag encoding of the integers[J].IEEE Trans. on Info. Theory.1988, 34(2):324-[15]Yamamoto H, Ochi H. A new asymptotically optimal code for the positive integers [J].IEEE Trans. on Info. Theory.1991, 37(5):1420-[16]Burrows M, Wheeler D J. A block-sorting lossless data compression algorithm [R]. Technical Report SRC 124, Digital System Research Center, Palo Alto, CA, 1994.[17]Bentley J L, Sleator D D, Tarjan R E, et al.. A locally adaptive data compression scheme[J].Commun. ACM.1986, 29(4):320-[18]Muramatsu J. On the performance of recency-rank and block-sorting universal lossless data compression algorithms[J].IEEE Trans. on Info. Theory.2002, 48(9):2621-