Fetching the paper…
Reading the bibliography…
The modern data compression is mainly based on two approaches to entropy coding: Huffman (HC) and arithmetic/range coding (AC).
D.A. Huffman, A Method for the Construction of Minimum-Redundancy Codes , Proceedings of the I.R.E., September 1952, pp 1098-1102,
1952
Earlier work this paper cites.
J.J. Rissanen, Generalized Kraft inequality and arithmetic coding , IBM J. Res. Develop., vol. 20, no. 3, pp. 198-203, May 1976,
1976
Earlier work this paper cites.
G.N.N. Martin, Range encoding: an algorithm for removing redundancy from a digitized message , Video and Data Recording Conf., Southampton, England, July 1979,
1979
Cited alongside, same era.
P. G. Howard, J. S. Vitter, Practical Implementations of Arithmetic Coding , Image and Text Compression, 1992, 85-112,
1992
Cited alongside, same era.
Y. Collet, Finite State Entropy, https://github.com/Cyan4973/FiniteStateEntropy ,
Cited in the paper.
Cited in the paper.
J. Duda, Asymmetric numerical systems , arXiv:0902.0271,
Cited in the paper.
J. Duda, Data Compression Using Asymmetric Numeral Systems , Wolfram Demonstration Project, http://demonstrations.wolfram.com/author.html?author=Jarek+Duda ,
Cited in the paper.
M. Mahoney, Data Compression Programs website, http://mattmahoney.net/dc/ ,
Cited in the paper.
W. Szpankowski, Asymptotic Average Redundancy of Huffman (and Other) Block Codes , IEEE Trans. Information Theory, 46
2000
Later among the works it cites.
D. Marpe, H. Schwarz, T. Wiegand, Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard , IEEE Transactions on Circuits and Systems for Video Technology, Vol. 13, No. 7, pp. 620-636, July 2003,
2003
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…