p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
arXiv:2503.05654
Abstract
We introduce the notion of p-adic spherical codes (in particular, p-adic kissing number problem). We show that the one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes, obtained by Pfender \textit{[J. Combin. Theory Ser. A, 2007]}, extends to p-adic Hilbert spaces.
6 Pages, 0 Figures. arXiv admin note: text overlap with arXiv:2411.05047