Bounds on sets with few distances

DOI10.1016/J.JCTA.2011.01.002zbMATH Open1231.05263arXiv0905.2423OpenAlexW2046196968MaRDI QIDQ2431616FDOQ2431616

Authors: Alexander Barg, Oleg R. Musin 

Publication date: 15 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0905.2423

Recommendations

• Bounds on three- and higher-distance sets
• Bounds for Binary Codes With Narrow Distance Distributions
• On a generalization of distance sets
• Bounds for the sum of distances of spherical sets of small size
• scientific article; zbMATH DE number 3874093

zbMATH Keywords

orthogonal polynomialsbinary codesintersecting familiesspherical codesdistance transitive spaces

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Hypergeometric orthogonal polynomials and their \(q\)-analogues. With a foreword by Tom H. Koornwinder
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Spherical codes and designs
• Title not available (Why is that?)
• On t-designs
• The Erdős-Ko-Rado theorem for vector spaces
• Four fundamental parameters of a code and their combinatorial significance
• A new proof of several inequalities on codes and sets
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• Intersection Properties of Systems of Finite Sets
• A generalization of the ray‐chaudhuri‐wilson theorem
• Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
• Spherical two-distance sets
• Title not available (Why is that?)
• On Two-Distance Sets in Euclidean Space
• Title not available (Why is that?)

Cited In (22)

• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• Towards a proof of the 24-cell conjecture
• An asymmetric bound for sum of distance sets
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• Quasiextremal distance sets
• On the size of maximal binary codes with 2, 3, and 4 distances
• Title not available (Why is that?)
• Boundedly connected sets and the distance to the intersection of two sets
• A new proof of a generalization of Gerzon's bound
• Title not available (Why is that?)
• New upper bounds on Enomoto Katona’s coding type problem
• Bounds for the sum of distances of spherical sets of small size
• Bounds for the minimum distance function
• Constructions of maximum few-distance sets in Euclidean spaces
• Bounds on three- and higher-distance sets
• Distance Sets on Circles
• On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
• Maximal 2-distance sets containing the regular simplex
• Upper bounds for \(s\)-distance sets and equiangular lines
• A geometrical characterization of strongly regular graphs
• Constructions of biangular tight frames and their relationships with equiangular tight frames

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)