Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0704.42025
Bannai, Eiichi
Orthogonal polynomials in coding theory and algebraic combinatorics. (English)
[A] Orthogonal polynomials: theory and practice, Proc. NATO ASI, Colombus/OH (USA) 1989, NATO ASI Ser., Ser. C 294, 25-53 (1990).

[For the entire collection see Zbl 0694.00015.] \par Author's abstract: This paper surveys the role of orthogonal polynomials in Algebraic Combinatorics, an area which includes association schemes, coding theory, design theory, various theories of group representation, and so on. The main topics discussed in this paper include the following: The connection between orthogonal polynomials and P-polynomial (or Q- polynomial) association schemes. The classification problem for P- and Q- polynomial association schemes and its connection with Askey-Wilson orthogonal polynomials, Delsarte theory of codes and designs in association schemes. The nonexistence of perfect e-codes and tight t- designs through the study of the zeros of orthogonal polynomials. The possible importance of multivariable versions of Askey-Wilson polynomials in the future study of general commutative association schemes.
[L.Gatteschi]

MSC 2000:: *42C05 General theory of orthogonal functions and polynomials
94C30 Appl. of design theory to circuits and networks
05C99 Graph theory

Keywords: coding theory; design theory; group representation; P-polynomial; Q- polynomial; Askey-Wilson orthogonal polynomials; Delsarte theory; perfect e-codes; tight t-designs; general commutative association schemes

Citations: Zbl 0694.00015

Cited in: Zbl 0757.05100

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]