Abstract: We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of subsets; (2) we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; (3) we prove a new bound on codes with few distances in the Hamming space, improving an earlier result of Delsarte. We also find the size of maximal binary codes and maximal constant-weight codes of small length with 2 and 3 distances.
Recommendations
Cites work
- A generalization of the ray‐chaudhuri‐wilson theorem
- A new proof of several inequalities on codes and sets
- Erdős-Ko-Rado-type results over J_q(n,d),H_q(n,d) and their designs
- Four fundamental parameters of a code and their combinatorial significance
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- scientific article; zbMATH DE number 446488 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 3234139 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Hypergeometric orthogonal polynomials and their q-analogues. With a foreword by Tom H. Koornwinder
- Intersection Properties of Systems of Finite Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On t-designs
- On Two-Distance Sets in Euclidean Space
- Spherical codes and designs
- Spherical two-distance sets
- The Erdős-Ko-Rado theorem for vector spaces
Cited in
(23)- Upper bounds for \(s\)-distance sets and equiangular lines
- A geometrical characterization of strongly regular graphs
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- A new proof of a generalization of Gerzon's bound
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- Maximal 2-distance sets containing the regular simplex
- An asymmetric bound for sum of distance sets
- Constructions of maximum few-distance sets in Euclidean spaces
- Bounds for the sum of distances of spherical sets of small size
- scientific article; zbMATH DE number 3874093 (Why is no real title available?)
- scientific article; zbMATH DE number 3977019 (Why is no real title available?)
- Quasiextremal distance sets
- Distance Sets on Circles
- Constructions of biangular tight frames and their relationships with equiangular tight frames
- Bounding the Size of an Almost-Equidistant Set in Euclidean Space
- New upper bounds on Enomoto Katona’s coding type problem
- Bounds for the minimum distance function
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Bounds on three- and higher-distance sets
- On the size of maximal binary codes with 2, 3, and 4 distances
- Towards a proof of the 24-cell conjecture
- Set families: restricted distances via restricted intersections
- Boundedly connected sets and the distance to the intersection of two sets
This page was built for publication: Bounds on sets with few distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431616)
