p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
preprint
OA: closed
CC-BY-4.0
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, extends to p-adic Hilbert spaces.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00
- unpaywall
- last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0