Given an open set <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$T\subset [-1,1)$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>⊂</mo> <mo stretchy="false">[</mo> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, we introduce the concepts of T-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set T. We show that certain codes found in the minimal vectors of the Leech lattice, as well as the minimal vectors of the Barnes–Wall lattice and codes derived from strongly regular graphs, are universally optimal in the restricted class of T-avoiding codes. We also extend a result of Delsarte–Goethals–Seidel about codes with three inner products <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$\alpha , \beta , \gamma $</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo>,</mo> <mi>γ</mi> </mrow> </math></EquationSource> </InlineEquation> (in our terminology <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$(\alpha ,\beta )$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-avoiding <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$\gamma $</EquationSource> <EquationSource Format="MATHML"><math> <mi>γ</mi> </math></EquationSource> </InlineEquation>-codes). Parallel to the notion of tight spherical designs, we also derive that these codes are minimal (tight) T-avoiding spherical designs of fixed dimension and strength. In some cases, we also find that codes under consideration have maximal cardinality in their T-avoiding class for given dimension and minimum distance.

Universal Optimality of T-avoiding Spherical Codes and Designs

期刊论文
发表日期：

2026年5月26日

查看全文

P. G. Boyvalenkov,
D. D. Cherkashin,
P. D. Dragnev

摘要

Given an open set $T\subset [-1,1)$ $T \subset [- 1, 1)$ , we introduce the concepts of T-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set T. We show that certain codes found in the minimal vectors of the Leech lattice, as well as the minimal vectors of the Barnes–Wall lattice and codes derived from strongly regular graphs, are universally optimal in the restricted class of T-avoiding codes. We also extend a result of Delsarte–Goethals–Seidel about codes with three inner products $\alpha , \beta , \gamma $ $α, β, γ$ (in our terminology $(\alpha ,\beta )$ $(α, β)$ -avoiding $\gamma $ $γ$ -codes). Parallel to the notion of tight spherical designs, we also derive that these codes are minimal (tight) T-avoiding spherical designs of fixed dimension and strength. In some cases, we also find that codes under consideration have maximal cardinality in their T-avoiding class for given dimension and minimum distance.