# p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound

Source: [p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound](<https://www.sota2.com/research/paper/68fa5d131e209131ce9d6be7>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T18:01:20.823Z

Authors: K. Mahesh Krishna

Published: 2025-02-22T05:22:25.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2503.05654>)

[PDF](<https://arxiv.org/pdf/2503.05654.pdf>)
