Designs as maximum codes in polynomial metric spaces
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3839853 (Why is no real title available?)
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 3705455 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3456979 (Why is no real title available?)
- scientific article; zbMATH DE number 3463504 (Why is no real title available?)
- scientific article; zbMATH DE number 3503264 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3274385 (Why is no real title available?)
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- A partially ordered set and q-Krawtchouk polynomials
- Alternating bilinear forms over GF(q)
- Association schemes and t-designs in regular semilattices
- Association schemes of quadratic forms
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for quaternionic line systems and reflection groups.
- Discrete quadrature and bounds on t-designs
- Equiangular lines
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Linearization of the Product of Jacobi Polynomials. I
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On 4-gonal configurations with parameters \(r = q^2 + 1\) and \(k = q + 1\)
- On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
- Orthogonal Polynomials, Duality and Association Schemes
- Polynomial spaces
- Positive definite functions on spheres
- Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
- Some maximal arcs in finite projective planes
- Some q-Krawtchouk Polynomials on Chevalley Groups
- Spherical codes and designs
- Spherical functions on symmetric Riemannian spaces
- Strongly regular graphs having strongly regular subconstituents
- Strongly regular graphs, partial geometries and partially balanced designs
- The Addition Formula for Jacobi Polynomials and Spherical Harmonics
- The Geometry of Two-Weight Codes
- Theory of codes with maximum rank distance
- Tight 4 and 5-designs in projective spaces
- Two-point homogeneous spaces
- t-designs in classical association schemes
- t-designs in projective spaces
Cited in
(55)- Stability of optimal spherical codes
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
- Semidefinite programming bounds for spherical three-distance sets
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Upper bounds for energies of spherical codes of given cardinality and separation
- Universally optimal distribution of points on spheres
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Bounds for sets with few distances distinct modulo a prime ideal
- Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements
- Unique optima of the Delsarte linear program
- Linear programming bounds for regular graphs
- Harmonic index designs in binary Hamming schemes
- A short history of frames and quantum designs
- Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
- Designs in finite metric spaces: a probabilistic approach
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- On spherical codes with inner products in a prescribed interval
- Universal lower bounds for potential energy of spherical codes
- High-dimensional sphere packing and the modular bootstrap
- 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
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- Optimal arrangements of classical and quantum states with limited purity
- Extremal polynomials for obtaining bounds for spherical codes and designs
- scientific article; zbMATH DE number 1498794 (Why is no real title available?)
- Towards a proof of the 24-cell conjecture
- Linear programming bounds for codes in infinite projective spaces
- Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
- On lower bounds on the size of designs in compact symmetric spaces of rank 1
- scientific article; zbMATH DE number 637359 (Why is no real title available?)
- Optimal measures for \(p\)-frame energies on spheres
- On the search for tight frames of low coherence
- Three-point bounds for energy minimization
- Bounds for the sum of distances of spherical sets of small size
- Bounds on three- and higher-distance sets
- Some constructions of superimposed codes in Euclidean spaces.
- On polarization of spherical codes and designs
- New upper bounds on Enomoto Katona’s coding type problem
- Upper energy bounds for spherical designs of relatively small cardinalities
- On designs in compact metric spaces and a universal bound on their size
- scientific article; zbMATH DE number 1341365 (Why is no real title available?)
- Computing distance distributions of spherical designs
- Energy bounds for codes and designs in Hamming spaces
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- scientific article; zbMATH DE number 4191741 (Why is no real title available?)
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
- Bounds on antipodal spherical designs with few angles
- Absolute minima of potentials of certain regular spherical configurations
- Bounds for spherical codes: the Levenshtein framework lifted
- A survey on spherical designs and algebraic combinatorics on spheres
- Packings in real projective spaces
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)
