Some aspects of Hankel matrices in coding theory and combinatorics

Electronic Journal of Combinatorics

Volumn 8, Issue 1 A, 2001, Pages 1-31

  Tamm, Ulrich ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242323419     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1595     Document Type: Article

References (85)

1. M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 - 675.
2. M. Aigner, "Catalan-like numbers and determinants", J. Combin. Theory Ser. A 87, 1999, 33 - 51.
3. M. Aigner, "A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207-210.
4. G. E. Andrews, "Plane partitions (III): The weak Macdonald conjecture", Invent. Math. 53, 1979, 193 - 225.
5. G. E. Andrews, "Pfaff's method. I. The Mills-Robbins-Rumsey determinant", Discrete Math. 193, no. 1-3, 1998, 43-60.
6. G. E. Andrews and D. Stanton, "Determinants in plane partition enumeration", Europ. J. Combin. 19, 1998, no. 3, 273 - 282.
7. R. Askey and M. Ismail, Recurrence Relations, Continued Fractions and Orthogonal Polynomials, Mem. Am. Math. Soc. 300, 1984.
8. E. A. Bender and D. E. Knuth, "Enumeration of plane partitions", J. Combin. Theory Ser. A 13, 1972, 40 - 54.
9. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, 1968.
10. E. R. Berlekamp, "Goppa Codes", IEEE Trans. Inform. Theory 19, 1973, 590 - 592.
11. R. E. Blahut, Theory and Practice of Error Control Codes, Addison - Wesley, 1984.
12. R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison - Wesley, 1985.
13. D. L. Boley, T. J. Lee, and F. T. Luk, "The Lanczos algorithm and Hankel matrix factorization", Lin. Alg. Appl. 172, 1992, 109 - 133.
14. D. L. Boley, F. T. Luk, and D. Vandevoorde, "A fast method to diagonalize a Hankel matrix", Lin. Alg. Appl. 284, 1998, 41 - 52.
15. M. Bousquet - Mélou and L. Habsieger, "Sur les matrices à signes alternants", Discrete Math. 139, 1995, 57 - 72.
16. D. M. Bressoud, Proofs and Confirmations, Cambridge Univ. Press, 1999.
17. C. Brezinski, Padé-Type Approximation and General Orthogonal Polynomials, Birkhäuser, 1980.
18. Lewis Carroll, Alice's Adventures in Wonderland, 1865.
19. P. L. Chebyshev, "Sur l'interpolation par la méthode des moindres carrés", Mém. Acad. Impér. Sci. St. Pétersbourg (7) 1 (15), 1859, 1 - 24, also: Oeuvres I, 473 - 489.
20. P. L. Chebyshev, "Sur l'interpolation par la méthode des moindres carrés", Mém. Acad. Impér. Sci. St. Pétersbourg (7) 1 (15), 1859, 1 - 24, also: Oeuvres I, 473 - 489.
21. U. Cheng, "On the continued fraction and Berlekamp's algorithm", IEEE Trans. Inform. Theory 30, 1984, 541 - 544.
22. S. H. Choi and D. Gouyou - Beauchamps, "Enumeration of generalized Young tableaux with bounded height", Theoret. Comp. Sci. 117, 1993, 137 - 151.
23. W. Chu, "Binomial convolutions and determinant identities", Discrete Math. 204, 1999, 129 - 153.
24. P. Delsarte, "Nombres de Bell et polynômes de Charlier", C. R. Acad. Sci. Paris (series A), t. 287, 1978, 271 - 273.
25. M. Desainte-Catherine and X. G. Viennot, "Enumeration of certain Young tableaux with bounded height", Combinatoire Énumérative (Montreal 1985), Lect. Notes Math. 1234, 1986, 58 - 67.
26. C. L. Dodgson, "Condensation of determinants", Proceedings of the Royal Society of London 15, 1866, 150 - 155.
27. P. Flajolet, "Combinatorial aspects of continued fractions", Discrete Math. 32, 1980, 125 - 161.
28. P. Flajolet, "On congruences and continued fractions for some classical combinatorial quantities", Discrete Math. 41, 1982, 145 - 153.
29. D. Foata, "Combinatoire des identités sur les polynômes orthogonaux", Proc. International Congress of Mathematicians, Warsaw, 1983 1541 - 1553.
30. I. Gessel, "A probabilistic method for lattice path enumeration", J. Statist. Plann. Inference 14, 1986, 49 - 58.
31. I. Gessel and R. Stanley, "Algebraic enumeration". in R. L. Graham, M. Grötschel, and L. Lovasz, Handbook of Combinatorics, Vol. 2, Wiley, 1996, 1021 - 1069,
32. I. Gessel and X. G. Viennot, "Binomial determinants, paths and hook length formulae", Advances in Mathematics 58, 1985, 300 - 321.
33. I. Gessel and X. G. Viennot, Determinants, Paths, and Plane Partitions, Preprint, 1989.
34. V. D. Goppa, "A new class of linear correcting codes", Problemy Peredachi Informatsii 6, no. 3, 1970, 24 - 30 (in Russian).
35. V. D. Goppa, "Rational representation of codes and (L,g) codes", Problemy Peredachi Informatsii 7, no. 3, 1971, 41 - 49 (in Russian).
36. V. D. Goppa, "Decoding and diophantine approximations", Problems of Control and Information Theory 5, no. 3, 1975, 195-206.
37. B. Gordon, "A proof of the Bender - Knuth conjecture", Pacific J. Math. 108, 1983, 99 - 113.
38. D. C. Gorenstein, W. W. Peterson, and N. Zierler, "Two-error correcting Bose-Chaudhuri codes are quasi-perfect", Information and Control 3, 1960, 291 - 294.
39. m symbols", J. Soc. Indus. Appl. Math. 9, 1961, 207 - 214.
40. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison Wesley, 1988.
41. A. J. Guttmann, A. L. Owczarek, and X. G. Viennot, "Vicious walkers and Young tableaux I: without walls", J. Phys. A: Math. Gen. 31, 1998, 8123 - 8135.
42. R. K. Guy, "Catwalks, sandsteps and Pascal pyramids", J. Integer Sequences 3, 2000, Article 00.1.6.
43. P. Hilton and J. Pedersen, "Catalan numbers, their generalization, and their uses", Math. Intelligencer 13, no. 2, 1991, 64 - 75.
44. K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp - Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 - 150.
45. E. Jonckheere and C. Ma, "A simple Hankel interpretation of the Berlekamp - Massey algorithm", Lin. Alg. Appl. 125, 1989, 65 - 76.
46. S. Lin and D. J. Costello, Error - Control Coding, Prentice - Hall, 1983.
47. B. Lindström, "On the vector representation of induced matroids", Bull. London Math. Soc. 5, 1973, 85 - 90.
48. M. E. Mays and J. Wojciechowski, "A determinant property of Catalan numbers", Discrete Math. 211, 2000, 125 - 133.
49. J. L. Massey, "Shift register synthesis and BCH decoding", IEEE Trans. Inform. Theory 15, 1969, 122 - 127.
50. W. H. Mills, "Continued fractions and linear recurrences", Math. Comp. 29, no. 129, 1975, 173 - 180.
51. W. H. Mills, D.P. Robbins, and H. Rumsey Jr., "Enumeration of a symmetry class of plane partitions", Discrete Math. 67, 1987, 43 - 55.
52. S. G. Mohanty, Lattice path counting and applications, Academic Press, 1979.
53. T. Muir, Theory of Determinants, Dover, 1960.
54. T. V. Narayana, Lattice Path Combinatorics, University of Toronto Press, 1979.
55. P. Peart and W.-J. Woan, "Generating functions via Hankel and Stieltjes matrices", J. Integer Sequences 3, 2000, Article 00.2.1.
56. O. Perron, Die Lehre von den Kettenbrüchen, Chelsea Publishing Company, 1929.
57. W. W. Peterson, "Encoding and error-correction procedures for the Bose-Chaudhuri codes", Trans. IRE 6, 1960, 459 - 470.
58. M. Petkovšek and H. S. Wilf, "A high-tech proof of the Mills-Robbins-Rumsey determinant formula", Electron. J. Combin. 3, no. 2, 1996, #R19.
59. J. L. Phillips, "The triangular decomposition of Hankel matrices", Math. Comp. 25 (115), 1971, 599 - 602.
60. G. Polya and G. Szegö, Aufgaben und Lehrsätze aus der Analysis, Vol. II, 3rd ed., 1964.
61. G. de Prony, "Essai expérimental et analytique sur les lois de la dilatabilité de fluides élastiques et sur les celles de la force expansive de la vapeur de l' alcool, à différentes températures", J. de l'École Polytechnique 1, cahier 22, 1795, 24 - 76.
62. C. Radoux, "Déterminants de Hankel et théorème de Sylvester", Proc. 28th Séminaire Lotharingien, 1992, 115 - 122.
63. C. Radoux, "Addition formulas for polynomials built on classical combinatorial sequences", J. Comp. Appl. Math. 115, 2000, 471 - 477.
64. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958.
65. J. Riordan, Combinatorial Identities, Wiley, 1968.
66. H. Rutishauser, Der Quotienten-Differenzen-Algorithmus, Birkhäuser, 1957.
67. L. W. Shapiro, "A Catalan triangle", Discrete Math., 14, 1976, 83 - 90.
68. R. P. Stanley, "Theory and application of plane partitions", Studies in Applied Mathematics 50, 1971, Part 1: 167 - 189, Part 2: 259 - 279.
69. R. P. Stanley, "Theory and application of plane partitions", Studies in Applied Mathematics 50, 1971, Part 1: 167 - 189, Part 2: 259 - 279.
70. R. P. Stanley, "A baker's dozen of conjectures concerning plane partitions", Combinatoire Énumérative (Montreal 1985), Lect. Notes Math. 1234, 1986, 285-293.
71. R. P. Stanley, Enumerative Combinatorics 2, Cambridge, 1999.
72. T. J. Stieltjes, "Recherches sur les fractions continues", Ann. Fac. Sci. Toulouse 8, 1894, J.1 - 122, 1895, A.1 - 47.
73. T. J. Stieltjes, Oeuvres Complètes, Springer, 1993.
74. V. Strehl, Contributions to the combinatorics of some families of orthogonal polynomials, mémoire, Erlangen, 1982.
75. Y. Sugiyama, M. Kasahara, S. Hirawawa, and T. Namekawa, "A method for solving key equation for decoding Goppa codes", Information and Control 27, 1975, 87 - 99.
76. U. Tamm, "Hankel matrices in coding theory and combinatorics", Preprint 00-055, SFB 343 "Diskrete Strukturen in der Mathematik", Univ. of Bielefeld, July 2000.
77. U. Tamm, "Lattice paths not touching a given boundary", J. Statist. Planning and Inference, submitted, 2000.
78. X. G. Viennot, "A combinatorial theory for general orthogonal polynomials with extensions and applications", Polynômes Orthogonaux et Applications, Proceedings, Bar - le - Duc, Springer 1984, 139 - 157.
79. X. G. Viennot, A combinatorial interpretation of the quotient - difference algorithm, Preprint, 1986.
80. H. S. Wall, Analytic Theory of Continued Fractions, Chelsea Publ. Company, 1948.
81. L. R. Welch and R. A. Scholtz, "Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 - 27.
82. D. Zeilberger, "Proof of the alternating sign matrix conjecture", Electron. J. Combin. 3, 1996 #R13, also in: The Foata Festschrift, ed. J. Désarmémien, A. Kerber, and V. Strehl, 289 - 273, Gap, France.
83. D. Zeilberger, "Proof of the alternating sign matrix conjecture", Electron. J. Combin. 3, 1996 #R13, also in: The Foata Festschrift, ed. J. Désarmémien, A. Kerber, and V. Strehl, 289 - 273, Gap, France.
84. D. Zeilberger, "Proof of the refined alternating sign matrix conjecture", New York Journal of Mathematics 2, 59 - 68, 1996.
85. D. Zeilberger, "Dodgson's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN", Electron. J. Combin. 4 (2), 1997, #R22.