p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
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 [J. Combin. Theory Ser. A, 2007], extends to p-adic Hilbert spaces.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.