Designs as maximum codes in polynomial metric spaces
From MaRDI portal
Publication:1201908
DOI10.1007/BF00053379zbMath0767.05097OpenAlexW1986015715MaRDI QIDQ1201908
Publication date: 17 January 1993
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00053379
upper boundsdesigndistance-regular graphsminimal distancepolynomial metric spacestight designsabsolute Delsarte bounddecomposable distance-regular graphsDelsarte codesdiametrical codemaximum codes
Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60) Distance in graphs (05C12) Designs and configurations (05B99)
Related Items (47)
Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) ⋮ Extremal polynomials for obtaining bounds for spherical codes and designs ⋮ Computing distance distributions of spherical designs ⋮ On lower bounds on the size of designs in compact symmetric spaces of rank 1 ⋮ Optimal measures for \(p\)-frame energies on spheres ⋮ An extremum problem for polynomials and bounds for codes with given distance and diameter ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ Three-point bounds for energy minimization ⋮ Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Unique optima of the Delsarte linear program ⋮ Absolute minima of potentials of certain regular spherical configurations ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ Linear programming bounds for regular graphs ⋮ Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials ⋮ Harmonic index designs in binary Hamming schemes ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ On polarization of spherical codes and designs ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements ⋮ Bounds on three- and higher-distance sets ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ On spherical codes with inner products in a prescribed interval ⋮ On the search for tight frames of low coherence ⋮ A short history of frames and quantum designs ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ Unnamed Item ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Towards a proof of the 24-cell conjecture ⋮ Packings in Real Projective Spaces ⋮ Universal lower bounds for potential energy of spherical codes ⋮ Optimality and uniqueness of the \((4,10,1/6)\) spherical code ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Bounds on antipodal spherical designs with few angles ⋮ Moment methods in energy minimization: New bounds for Riesz minimal energy problems ⋮ Some constructions of superimposed codes in Euclidean spaces. ⋮ Lower bounds for projective designs, cubature formulas and related isometric embeddings ⋮ Linear programming bounds for codes in infinite projective spaces ⋮ Energy bounds for codes in polynomial metric spaces ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications ⋮ Universally optimal distribution of points on spheres ⋮ On designs in compact metric spaces and a universal bound on their size ⋮ ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS ⋮ Bounds for spherical codes: The Levenshtein framework lifted
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- t-designs in projective spaces
- Association schemes of quadratic forms
- Theory of codes with maximum rank distance
- t-designs in classical association schemes
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Tight 4 and 5-designs in projective spaces
- Strongly regular graphs having strongly regular subconstituents
- A partially ordered set and q-Krawtchouk polynomials
- On 4-gonal configurations with parameters \(r = q^2 + 1\) and \(k = q + 1\)
- Association schemes and t-designs in regular semilattices
- Alternating bilinear forms over GF(q)
- Spherical codes and designs
- Bilinear forms over a finite field, with applications to coding theory
- Discrete quadrature and bounds on t-designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Polynomial spaces
- Equiangular lines
- Strongly regular graphs, partial geometries and partially balanced designs
- Two-point homogeneous spaces
- Positive definite functions on spheres
- On Uniformly Packed [n , n -k , 4 Codes over GF(q ) and a Class of Caps in PG(k -1, q )]
- The Geometry of Two-Weight Codes
- Some q-Krawtchouk Polynomials on Chevalley Groups
- Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
- Orthogonal Polynomials, Duality and Association Schemes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Bounds for quaternionic line systems and reflection groups.
- The Addition Formula for Jacobi Polynomials and Spherical Harmonics
- Spherical functions on symmetric Riemannian spaces
- Some maximal arcs in finite projective planes
- Linearization of the Product of Jacobi Polynomials. I
- Hahn Polynomials, Discrete Harmonics, andt-Designs
This page was built for publication: Designs as maximum codes in polynomial metric spaces
