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

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.

Publication Details

Journal
ArXiv.org
Published
2025-02-22
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

ArXiv.org
Coding theory and cryptography
article

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

article en

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.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 73%
Coding theory and cryptography
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound · ArXiv.org (2025) | TGRS Research Map | TGRS