Fetching the paper…
Reading the bibliography…
In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely chosen probability distributions of symbols.
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.
Gallager, R. G., Low Density Parity Check Codes, Monograph , M.I.T. Press, 1963,
1963
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
Cited alongside, same era.
G.N.N. Martin, Range encoding: an algorithm for removing redundancy from a digitized message , Video and Data Recording Conf., Southampton, England, July 1979. vol. 2, pp 179-194, July 1992
1992
Cited alongside, same era.
Cited in the paper.
M. Mahoney, Data Compression Programs web site, http://cs.fit.edu/ mmahoney/compression/
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. Matsumoto, Y. Kurita, Twisted GFSR generators , ACM Transactions on Modeling and Computer Simulation,
Cited in the paper.
D. MacKay, Information Theory, Inference, and Learning Algorithms , Cambridge University Press (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…