Association schemes and coding theory
From MaRDI portal
Publication:4701199
DOI10.1109/18.720545zbMath0946.05086WikidataQ30039866 ScholiaQ30039866MaRDI QIDQ4701199
Vladimir I. Levenshtein, Philippe Delsarte
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.720545
survey; linear programming; upper bounds; association schemes; duality; lower bounds; universal bounds; distance distribution; codes and designs; polynomial schemes; translation schemes
Related Items
An extremum problem for polynomials and bounds for codes with given distance and diameter, Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\), \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality, On the minimum average distance of binary constant weight codes, On non-antipodal binary completely regular codes, \(Z_2Z_4\)-linear codes: rank and kernel, A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs, A survey on spherical designs and algebraic combinatorics on spheres, Commutative association schemes, Beyond the orthogonal array concept., A minimal design of order 11 on the 3-sphere, Geometry of the Welch bounds, On the natural representation of \(S({\Omega})\) into \(L ^{2}(\mathcal{P}({\Omega)})\) : Discrete harmonics and Fourier transform, Symmetric bilinear forms over finite fields of even characteristic, Designs, groups and lattices, Association schemes arising from bent functions, PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES
