Cyclic Self-Dual Codes over Prime-Square Rings and Unimodular Lattices

We present an explicit construction of cyclic Euclidean self-dual codes over $\mathbb{Z}/p^{2}\mathbb{Z}$, where $p$ is an odd prime, and use Construction~A to obtain unimodular lattices with large minimum norms. The construction is based on reciprocal factorizations of $x^n-1$. We explicitly describe the associated residue and torsion codes and analyze the relationship between minimum Euclidean weights and lattice minimum norms. We construct a unimodular lattice of minimum norm~$4$ in dimension~$49$, unimodular lattices of minimum norm~$5$ in dimensions $53$, $55$, $58$, $59$, and~$61$, and extremal unimodular lattices of minimum norm~$6$ in dimensions $69$ and~$71$. Using shadow theory and harmonic theta series, we prove that extremal unimodular lattices do not exist in dimensions $59$ and~$61$. Together with the known upper bounds, these results establish the optimality of the constructed lattices in all eight dimensions. In particular, we determine the previously unknown optimal minimum norms of unimodular lattices in five dimensions: $53$, $55$, $61$, $69$, and~$71$. We further construct unimodular lattices whose minimum norms are exactly one below the corresponding extremal bounds in dimensions $62$, $63$, $65$, $67$, $70$, $89$, $91$, $92$, $93$, and~$94$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24153
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Cyclic Self-Dual Codes over Prime-Square Rings and Unimodular Lattices

Patrick Solé, Mengru Yang, Minjia Shi
arXiv (Cornell University)
Coding theory and cryptography
preprint

Cyclic Self-Dual Codes over Prime-Square Rings and Unimodular Lattices

Patrick Solé, Mengru Yang, Minjia Shi
preprint en

Abstract

We present an explicit construction of cyclic Euclidean self-dual codes over $\mathbb{Z}/p^{2}\mathbb{Z}$, where $p$ is an odd prime, and use Construction~A to obtain unimodular lattices with large minimum norms. The construction is based on reciprocal factorizations of $x^n-1$. We explicitly describe the associated residue and torsion codes and analyze the relationship between minimum Euclidean weights and lattice minimum norms. We construct a unimodular lattice of minimum norm~$4$ in dimension~$49$, unimodular lattices of minimum norm~$5$ in dimensions $53$, $55$, $58$, $59$, and~$61$, and extremal unimodular lattices of minimum norm~$6$ in dimensions $69$ and~$71$. Using shadow theory and harmonic theta series, we prove that extremal unimodular lattices do not exist in dimensions $59$ and~$61$. Together with the known upper bounds, these results establish the optimality of the constructed lattices in all eight dimensions. In particular, we determine the previously unknown optimal minimum norms of unimodular lattices in five dimensions: $53$, $55$, $61$, $69$, and~$71$. We further construct unimodular lattices whose minimum norms are exactly one below the corresponding extremal bounds in dimensions $62$, $63$, $65$, $67$, $70$, $89$, $91$, $92$, $93$, and~$94$.

arXiv (Cornell University)
Coding theory and cryptography
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.

Laika access coming soon