An Inversion Formula for Krawtchcuk Polynomials with Applications to Coding Theory

DOI10.1080/02522667.1990.10699017zbMath0708.05063OpenAlexW2316014021MaRDI QIDQ3490044

Patrick Solé

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699017

zbMATH Keywords

generating functionsorthogonal polynomialslinear codesStirling numbers of the second kindKrawtchouk polynomialscovering radius of codesHamming association schemePless' enumeration formulas

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (3)

The covering radius of spherical designs ⋮ Asymptotic analysis of the Krawtchouk polynomials by the WKB method ⋮ Mehler-Heine type formulas for the Krawtchouk polynomials

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An Inversion Formula for Krawtchcuk Polynomials with Applications to Coding Theory