Quantized Indexing References    (feedback)

R.V. Tomic  Fast, optimal entropy coder   1stWorks TR04-0815, 52p, Aug 2004
Introduction to Enumerative Coding, lattice walks & QI  for programmers
R.V. Tomic  Quantized indexing: Background information  1stWorks TR05-0625, 39p, Jun 2005
General EC/QI, comparison with Arithmetic Coding, EC/QI Modeling pattern
R.V. Tomic  Quantized Indexing: Beyond Arithmetic Coding  arXiv  cs.IT/0511057, 10p, Nov 2005
Concise, formal intro to QI, Sliding Window Integers, QI vs. AC test results, 1stWorks TR05-1115
R.V. Tomic  Quantized Indexing: Beyond Arithmetic Coding  DCC-2006 Poster, 1p, Jan 2006

  1. T. M. Cover  Enumerative Source Coding   IEEE Trans. Inform. Theory  IT-19 (1), 73-77, 1973
  2. C. E. Shannon   A mathematical theory of communication  Bell Syst. Tech. J. 27, 79-423, 1948
  3. N. Abramson  Information Theory and Coding  (37 Mb)  McGraw-Hill 1963 
  4. A. Moffat, R. M. Neal, I.H. Witten  Arithmetic coding revisited
ACM Trans. on Inf. Sys. Vol 16, No 3, 256-294, July 1998
  5. J. Rissanen  Generalised Kraft inequality and arithmetic coding
IBM J. Res. Dev. 20, 198-203, 1976
  6. A. Bookstein, S.T. Klein  Is Huffman coding dead?  Computing, 50:279-296, 1993
  7. Arithmetic Coder (C Source)  by the authors of Ref  [4], Version 3, Jan 2000
  8. D.H. Lehmer The Machine Tools of Combinatorics  in Applied Comb. Math., Wiley 1964
R. Brak  Enumerative Combinatorics (lattice paths) Lectures, AMSI Summer School,  2003
  9. T.J. Lynch Sequence time coding for data compression  Proc. IEEE 54 (10), 1490-1491, 1966
  10. L.D. Davisson Comments on ‘Sequence time coding for data compression’
Proc. IEEE Vol 54, 2010, Dec 1966
  11. J.P.M. Schalkwijk   An algorithm for source coding
IEEE Trans. Inform. Theory  IT-18 (3), 395-399, 1972
  12. J. C. Lawrence   A new universal coding scheme for the binary memoryless source
IEEE Trans. Inform. Theory  IT-23 (4), 466-472, 1977
  13. T.J. Tjalkens F.M.J. Willems  
A universal variable-to-fixed length source code based on Lawrence’s algorithm
IEEE Trans. Inform. Theory  IT-38 (2), 247-253, 1992
  14. L. Öktem, J. Astola  Hierarchical enumerative coding of locally stationary binary data
Electronics Letters, 35 (17), 1428-1429, 1999
  15. V. Dai, A. Zakhor   Binary Combinatorial Coding  Proc. DCC 2003, 420, 2003
  16. K.A.S. Immink, A.J.E.M. Janssen   Effects of Floating-Point Arithmetic in Enumerative Coding
Proc. 18th Symp. Inform. Theory Symp. Benelux, Veldhoven, 70-75, May 1997
  17. E.M. Reingold, J. Nievergelt, N. Deo  Combinatorial Algorithms  Prentice Hall 1977
  18. D. Kreher, D.R. Stinson  Combinatorial Algorithms  CRC Press 1998
  19. R.L. Graham, D.E. Knuth, O. Patashnik Concrete Mathematics  Addison-Wesley 1992
  20. D.E. Knuth The Art of Computer Programming Vol 1-3,  Addison-Wesley 1973
  21. D.E. Knuth   The Art of Computer Programming  Vol 4, preview copy
  22. G. Pólya, R.E. Tarjan, D.R. Woods Notes on Introductory Combinatorics  Birkhäuser 1983
  23. L. Öktem   Hierarchical Enumerative Coding and Its Applications in Image Compressing
Ph.D. thesis, TUT Finland, 1999 
  24. T.M. Cover, J.A. Thomas Elements of Information Theory  Wiley 1991
  25. W. Myrvold F. Ruskey   Ranking and Unranking Permutations in Linear Time
Information Processing Letters, 79,  281-284, 2001
  26. K.A.S. Immink   A Practical Method for Approaching the Channel Capacity of Constrained Channels
IEEE Trans. Inform. Theory  IT-43 (5), 1389-1399, 1997
  27. J. Rissanen   Arithmetic codings as number representations
Acta Polytechnica Scandinavica, Math. & Comp. Sc.  Vol. 31 pp 44-51, 1979
  28. L.D. Davisson  Universal noiseless coding  IEEE Trans. Inform. Theory  IT-19 (6), 783-795, 1973
  29. J. Rissanen, G.G. Langdon  Universal Modeling and Coding
IEEE Trans. Inform. Theory  IT-19 (1), 12-23, 1981
  30. A. Barron, J. Rissanen, Bin Yu  The minimum description length principle in coding and modeling
IEEE Trans. Inform. Theory  IT-44 (6), 2743-2760, 1998   MDL Central
  31. A.N. Kolmogorov  Three approaches to the quantitative definition of information  (in Russian)
Problems of Inform.Transmission, 1(1), 1-7, 1965
  32. P. Grünwald, P. Vitányi   Shannon Information and Kolmogorov Complexity
arXiv cs.IT/0410002, 2004   Algorithmic Information Theory 
  33. R. Krichevsky, V. Trofimov   The performance of universal encoding
IEEE Trans. Inform. Theory  IT-27 (2), 199-207, 1981
  34. J.G. Cleary, I.H. Witten  A Comparison of Enumerative and Adaptive Codes
IEEE Trans. Inform. Theory  IT-30 (2), 306-315, 1984
  35. L. Öktem, J. Astola  Hierarchical Enumerative Coding of First Order Markovian Binary Sources
Electronics Letters. 35 (23), pp. 2003-2005, 1999.
  36. T.J. Tjalkens   Efficient and fast data compression codes for discrete sources with memory
Ph.D. thesis, Eindhoven University of Technology, Sep 1987
  37. V.N. Potapov  Theory of Information  (in Russian), Novosibirsk Univ. 1999
  38. F. Ruskey   Combinatorial Generation   CSC-425/520 Univ. of Victoria CA,2003
  39. I.H. Witten, R.M. Neal, J.G. Cleary  Arithmetic coding for data compression
Commun. ACM 30, 6 (June), 520-540, 1987
  40. J.C. Kieffer  Second Order Analysis of Data Compression Algorithms  (Preprint)
  41. M.Drmota, H-K. Hwang, W. Szpankowski  
Precise Average Redundancy of an Idealized Arithmetic Coding   DCC 2002, 222-231.   
 41a. P.A.J. Volf  Weighting Techniques In Data Compression: Theory and Algorithms
Ph.D. thesis, Eindhoven University of Technology, Dec 2002
B. Ryabko, A. Fionov  Fast and Space-Efficient Adaptive Arithmetic Coding
Proc. 7th IMA Intern. Conf. on Cryptography and Coding, 1999
P.G. Howard, J.S. Vitter  Practical Implementations of Arithmetic Coding
Tech. Rep.  No. 92-18, CS, Brown University, 1992
V.N. Potapov  Arithmetic Coding of Probabilistic Sources (in Russian)
Supplement to lecture notes,  Novosibirsk University, 2001
  42. P. Andreasen  Universal Source Coding  M.Sc thesis, Math. Dept., Univ. of Copenhagen, 2001
  43. B. Ryabko, J. Suzuki, F. Topsoe 
Hausdorff Dimension as a New Dimension in Source Coding and Predicting
IEEE Information Theory Workshop, South Africa, pp.66-68, 1999
  44. J. Suzuki,  B. Ryabko   Coding Combinatorial Sources with Costs
Int. Symposium on Inform. Theory Proc. IEEE Yokohama, Japan, p.113, 2003
  45. K. Hojo,  B. Ryabko, J. Suzuki
It is not enough to assume stationary ergodic sources for analyzing universal coding.
Correspondence (1998)
  46. L. Öktem, R. Öktem, K. Egiazarian, J. Astola
Efficient Encoding Of The Significance Maps In Wavelet Based Image Compression
Proc. ISCAS 2000, 28-31 May, Geneva, Switzerland
  47. V. DaiA. Zakhor  Advanced Low-complexity Compression for Maskless Lithography Data
Emerging Lithographic Techniques VIII, Proc. SPIE, 5374 , February 2004
  48. J. Ziv, A. Lempel   Compression of individual sequences via variable-rate coding
IEEE Trans. Inform. Theory  IT-24 (5), 530-536, 1978
  49. N.J. Larsson  Structures of String Matching and Data Compression
Ph.D. thesis, Dept. of Computer Science, Lund University, 1999
  50. J.C. Kieffer, E. Yang  Grammar based codes: A new class of universal lossless source codes
IEEE Trans. Inform. Theory  IT-46 (3), 737-754, 2000
  51. E.Yang, D. He, J.C. Kieffer  Grammar-Based Coding: New Perspectives
Proc. of the 2004 IEEE Inform. Theory Workshop, San Antonio, TX, 2004
  52. M. Weinberger, G. Seroussi
Sequential Prediction and Ranking in Universal Context Modeling and Data Compression
HP Labs Tech. Rep. HPL-94-111, December 06, 1994
  53. M. Feder, N. Merhav, M. Gutman  Universal prediction of individual sequences
IEEE Trans. Inform. Theory  IT-38 (4), 1258-1270, 1992
  54. J. Rissanen  Universal coding, information, prediction, and estimation
IEEE Trans. Inform. Theory  IT-30 (4), 629-636, 1984
  55. M.J. Weinberger, J. Rissanen, M. Feder   A universal finite memory source
IEEE Trans. Inform. Theory  IT-41 (3), 643-652, 1995
  56. J.G. Cleary, I.H. Witten  Data Compression Using Adaptive Coding and Partial String Matching
IEEE Trans. Comm., COM-32 (4), 396-402, 1984
  57. B. Ryabko, J. Astola, K. Egiazarian   Fast Codes for Large Alphabets  Arxiv cs.IT/0504005
  58. J. Rissanen   Lectures on Statistical Modeling Theory  Tampere Univ. of Techn., Finland, 2002
  59. M. Drmota, Y. Bugeaud, W. Szpankowski 
On the Construction of (Explicit) Khodak’s Code and Its Analysis
IEEE Trans. Inform. Theory 2004 (submitted)
  60. Z. Kokosinski  Algorithms for Unranking Combinations and Other Related Choice Functions
TR-95-1-006 Univ. of Aizu, Fukushima Japan, 1995
  61. B. Ryabko   Fast Enumerative Source Coding  IEEE Intern. Symp. on Inform. Theory,pp 395, 1995
  62. B. Ryabko   Fast Enumeration of Combinatorial Objects
Discrete Mathematics and Applications pp 163-182, 1998
  63. M. Burrows, D.J. Wheeler   A Block-sorting Lossless Data Compression Algorithm
Digital Systems Research Center, RR-124, 1994
  64. M. Nelson  Data Compression with the Burrows-Wheeler Transform  Dr. Dobb's J., Sep 1996
  65. P. Fenwick   Reflections on Burrows Wheeler compression
Univ. of Auckland, New Zealand, C.S. Report No 172, Jul 2004  
  66. B. Balkenhol, S. Kurtz
Universal Data Compression Based on the Burrows and Wheeler Transformation: Theory and Practice
Univ. Bielefeld, Diskrete Strukturen in der Mathematik, Report 98-069, Sep 1998
  67. S. Deorowicz   Universal lossless data compression algorithms
Ph.D. thesis, Silesian Univ. of Technology, 2003
  68. M. Effros, K. Visweswariah, S. Kulkarni, S. Verdu 
Universal lossless source coding with the Burrows Wheeler transform 
IEEE Trans. Inform. Theory IT-48 (5), 1061-1081, 2002
  69. F.M.J. Willems, Y.M. Shtarkov, T.J. Tjalkens  The Context-Tree Weighting Method : Basic Properties
IEEE Trans. Inform. Theory IT-41 (3), 653-664, 1995
  70. D. Baron, Y. Bresler   Tree Source Identification with the Burrows Wheeler Transform
Proceedings CISS 2000 Vol. 2, pp. FA1-10-FA1-15, March 2000
  71. E. Gamma, R. Helm, R. Johnson, J. Vlissides  Design Patterns   Addison-Wesley 1995