Bounds on sets with few distances

DOI10.1016/j.jcta.2011.01.002zbMath1231.05263arXiv0905.2423OpenAlexW2046196968MaRDI QIDQ2431616

Alexander Barg, Oleg R. Musin

Publication date: 15 April 2011

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

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

zbMATH Keywords

orthogonal polynomialsbinary codesspherical codesintersecting familiesdistance transitive spaces

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (10)

Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Distance Sets on Circles ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ On \(q\)-ary codes with two distances \(d\) and \(d+1\) ⋮ Maximal 2-distance sets containing the regular simplex ⋮ Bounds on three- and higher-distance sets ⋮ A geometrical characterization of strongly regular graphs ⋮ Towards a proof of the 24-cell conjecture ⋮ Constructions of biangular tight frames and their relationships with equiangular tight frames ⋮ A new proof of a generalization of Gerzon's bound

Cites Work

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

This page was built for publication: Bounds on sets with few distances