Abstract
Special matrices are explored in many areas of science and technology. Krawtchouk matrix is such a matrix that plays important role in coding theory and theory of orthogonal arrays also called fractional factorial designs in planning of experiments and statistics. In this paper we give explicitly Smith normal forms of Krawtchouk matrix and its extended matrix. Also we propose a computationally effective method for determining the Hamming distance distributions of an orthogonal array with given parameters. The obtained results facilitate the solving of many existence and classification problems in theory of codes and orthogonal arrays.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boyvalenkov, P., Kulina, H.: Investigation of binary orthogonal arrays via their distance distributions. Probl. Inf. Transm. 49(4), 320–330 (2013)
Boyvalenkov, P., Marinova, T., Stoyanova, M.: Nonexistence of a few binary orthogonal arrays. Discret. Appl. Math. 217(2), 144–150 (2017)
Boumova, S., Marinova, T., Stoyanova, M.: On ternary orthogonal arrays. In: Proceedings of 16th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XVI), Svetlogorsk, Russia, 2–8 September 2018, pp. 102–105 (2018). https://www.dropbox.com/s/h7u89lh8vyirww9/Proceedings%20final.pdf?dl=0
Delsarte, P.: Bounds for unrestricted codes by linear programming. Philips Res. Rep. 27, 272–289 (1972)
Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance. Inform. Control 23, 407–438 (1973)
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. (10) (1973)
Hedayat, A., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer, New York (1999). https://doi.org/10.1007/978-1-4612-1478-6
Krawtchouk, M.: Sur une généralisation des polynômes d’Hermite. Compt. Rend. 189, 620–622 (1929)
Levenshtein, V.I.: Krawtchouk polynomials and universal bounds for codes and designs in hamming spaces. IEEE Trans. Inform. Theory 41(5), 1303–1321 (1995)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)
Riordan, J.: Combinatorial Identities. Wiley, Hoboken (1968)
Sloane, N.J.A.: http://neilsloane.com/oadir/index.html
https://store.fmi.uni-sofia.bg/fmi/algebra/stoyanova/toa.html
Szego, G.: Orthogonal Polynomials, vol. 23. AMS Col. Publ., Providence (1939)
Acknowledgments
This work has been accomplished with the financial support of the Ministry of Education and Science of Bulgaria by the Grant No. D01-221/03.12.2018 for National Centre of High-performance and Distributed Computing—part of the Bulgarian National Roadmap on RIs.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Manev, N.L. (2020). Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2019. Lecture Notes in Computer Science(), vol 11958. Springer, Cham. https://doi.org/10.1007/978-3-030-41032-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-41032-2_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41031-5
Online ISBN: 978-3-030-41032-2
eBook Packages: Computer ScienceComputer Science (R0)