Designs as maximum codes in polynomial metric spaces
From MaRDI portal
Publication:1201908
DOI10.1007/BF00053379zbMATH Open0767.05097OpenAlexW1986015715MaRDI QIDQ1201908FDOQ1201908
Authors: Vladimir Levenshtein 
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
Recommendations
- Necessary conditions for existence of some designs in polynomial metric spaces
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- scientific article; zbMATH DE number 503183
- scientific article; zbMATH DE number 2077080
- Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
designupper boundsdistance-regular graphsminimal distancepolynomial metric spacestight designsabsolute Delsarte bounddecomposable distance-regular graphsDelsarte codesdiametrical codemaximum codes
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60) Designs and configurations (05B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Two-Weight Codes
- Title not available (Why is that?)
- Bilinear forms over a finite field, with applications to coding theory
- Positive definite functions on spheres
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Theory of codes with maximum rank distance
- A partially ordered set and q-Krawtchouk polynomials
- Association schemes and t-designs in regular semilattices
- Alternating bilinear forms over GF(q)
- Title not available (Why is that?)
- Spherical codes and designs
- Two-point homogeneous spaces
- Orthogonal Polynomials, Duality and Association Schemes
- Title not available (Why is that?)
- t-designs in projective spaces
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Linearization of the Product of Jacobi Polynomials. I
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Strongly regular graphs having strongly regular subconstituents
- Equiangular lines
- Title not available (Why is that?)
- Association schemes of quadratic forms
- Title not available (Why is that?)
- Some maximal arcs in finite projective planes
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Polynomial spaces
- Strongly regular graphs, partial geometries and partially balanced designs
- t-designs in classical association schemes
- Some q-Krawtchouk Polynomials on Chevalley Groups
- Bounds for quaternionic line systems and reflection groups.
- The Addition Formula for Jacobi Polynomials and Spherical Harmonics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tight 4 and 5-designs in projective spaces
- Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
- On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
- Discrete quadrature and bounds on t-designs
- On 4-gonal configurations with parameters \(r = q^2 + 1\) and \(k = q + 1\)
- Spherical functions on symmetric Riemannian spaces
Cited In (55)
- Stability of optimal spherical codes
- Semidefinite programming bounds for spherical three-distance sets
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
- On spherical codes with inner products in a prescribed interval
- Optimal measures for \(p\)-frame energies on spheres
- Three-point bounds for energy minimization
- Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
- Towards a proof of the 24-cell conjecture
- Title not available (Why is that?)
- Packings in real projective spaces
- Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements
- Title not available (Why is that?)
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- Title not available (Why is that?)
- Computing distance distributions of spherical designs
- Bounds for sets with few distances distinct modulo a prime ideal
- Unique optima of the Delsarte linear program
- On lower bounds on the size of designs in compact symmetric spaces of rank 1
- Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
- Energy bounds for codes in polynomial metric spaces
- Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Bounds for spherical codes: the Levenshtein framework lifted
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- High-dimensional sphere packing and the modular bootstrap
- On polarization of spherical codes and designs
- Linear programming bounds for regular graphs
- A survey on spherical designs and algebraic combinatorics on spheres
- A short history of frames and quantum designs
- Upper energy bounds for spherical designs of relatively small cardinalities
- Absolute minima of potentials of certain regular spherical configurations
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- New upper bounds on Enomoto Katona’s coding type problem
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Designs in finite metric spaces: a probabilistic approach
- On the search for tight frames of low coherence
- Bounds for the sum of distances of spherical sets of small size
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
- Extremal polynomials for obtaining bounds for spherical codes and designs
- Linear programming bounds for codes in infinite projective spaces
- Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
- Some constructions of superimposed codes in Euclidean spaces.
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
- Universally optimal distribution of points on spheres
- Optimal arrangements of classical and quantum states with limited purity
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Harmonic index designs in binary Hamming schemes
- Bounds on three- and higher-distance sets
- Energy bounds for codes and designs in Hamming spaces
- Bounds on antipodal spherical designs with few angles
- On designs in compact metric spaces and a universal bound on their size
- Universal lower bounds for potential energy of spherical codes
- Title not available (Why is that?)
- Upper bounds for energies of spherical codes of given cardinality and separation
This page was built for publication: Designs as maximum codes in polynomial metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201908)
