Every Binary Self-Dual Code Arises From Hilbert Symbols

Ted Chinburg, Ying ZhangarXiv 2012 · DOI · arXiv

Abstract: In this paper we construct binary self-dual codes using the étale cohomology of $\mathbb{Z}/2$ on the spectra of rings of $S$-integers of global fields. We will show that up to equivalence, all self-dual codes of length at least 4 arise from Hilbert pairings on rings of $S$-integers of $\mathbb{Q}$. This is an arithmetic counterpart of a result of Kreck and Puppe, who used cobordism theory to show that all self-dual codes arise from Poincaré duality on real three manifolds.

Introduction

Binary self-dual codes are fundamental objects in coding theory, defined as linear subspaces $V \subseteq \mathbb{F}_2^{2n}$ such that $V = V^\perp$. Beyond their utility in error correction, they are deeply linked to unimodular lattices and sphere packings. In 2008, mathematicians Kreck and Puppe established a topological origin for these codes, showing they arise from Poincaré duality on three-manifolds.

This work by Ted Chinburg and Ying Zhang provides the arithmetic counterpart to that topological result. The authors demonstrate that every binary self-dual code of length 4 or greater can be constructed using the arithmetic of rational numbers—specifically, through Hilbert pairings on rings of $S$-integers. This reinforces the "three-manifold analogy" in arithmetic geometry, where the spectra of rings of integers behave like 3-manifolds.

Theoretical Framework and Methodology

The construction relies on étale cohomology, specifically the cohomology of the constant sheaf $\mathbb{Z}/2$ over the spectrum $X = \text{Spec}(\mathcal{O}_{K,S})$ of a ring of $S$-integers in a global field $K$.

Global to Local Mapping

The core of the construction is a restriction homomorphism $\Phi$: $$ H^1(X, \mathbb{Z}/2) \to \bigoplus_{v \in S} H^1(K_v, \mathbb{Z}/2) $$ where $K_v$ are the local completions of $K$ at the places in $S$. Using Artin-Verdier duality—the arithmetic analogue of Poincaré duality—the authors prove that the image of $\Phi$ is its own orthogonal complement under a pairing derived from the Hilbert symbol.

Hilbert Pairings and Boxed Matrices

The "inner product" defining the code's duality is provided by the Hilbert symbol $(a, b)_v$, which indicates whether the equation $ax^2 + by^2 = z^2$ has a non-trivial solution in the local field $K_v$. To prove universality, the authors introduce "boxed matrices," a new parametrization for generator matrices.

Table illustrating the mapping of S-units to local places, forming the basis of the self-dual code construction.

The table above illustrates how specific $S$-units (like primes $p_i$ and $-1$) map to local components at different places $W_v$. Through an inductive argument, the authors show that any self-dual code can be transformed into this "boxed" form and subsequently realized via a specific set of primes in $\mathbb{Q}$.

Key Results and Examples

The primary contribution is Theorem 1.3, which confirms that up to equivalence, every binary self-dual code of length $n \ge 4$ arises from this construction using the rational numbers $\mathbb{Q}$. Remarkably, complex number fields are not required; the diversity of codes is captured entirely by the choice of the set of primes $S$.

The paper demonstrates this by re-deriving classic codes:

  • The Hamming Code ($e_8$): Realized using the set of places $S = \{\infty, 2, 3, 7\}$.
  • The Golay Code ($g_{24}$): Realized using a specific set of 12 primes, including $\{\infty, 2, 7, 19, \dots, 39079\}$.

Insights and Future Directions

This research identifies that specific primes provide the necessary "Euclidean basis" for codes. For instance, an odd prime $p$ contributes to the structure if $p \equiv 3 \pmod 4$.

While this work focuses on binary codes, it opens several avenues:

  1. Higher Fields: Extending the construction to codes over larger finite fields would require more advanced cohomological tools.
  2. Topological Explicit Link: It remains an open question whether the "boxed matrix" descriptions can be used to explicitly construct the specific three-manifolds identified by Kreck and Puppe.
  3. Lattice Theory: The connection between these arithmetic codes and unimodular lattices suggests new methods for classifying high-dimensional lattices.

The universality of $\mathbb{Q}$ in this context is a striking result, suggesting that the "arithmetic boundary" of the rational numbers is rich enough to encode all possible binary self-dual structures.

Summary updated

Abstract

In this paper we construct binary self-dual codes using the étale cohomology of $\mathbb{Z}/2$ on the spectra of rings of $S$-integers of global fields. We will show that up to equivalence, all self-dual codes of length at least 4 arise from Hilbert pairings on rings of $S$-integers of $\Q$. This is an arithmetic counterpart of a result of Kreck and Puppe, who used cobordism theory to show that all self-dual codes arise from Poincaré duality on real three manifolds.
BibTeX
@misc{chinburg2012every,
  author = {Ted Chinburg and Ying Zhang},
  title = {{Every Binary Self-Dual Code Arises From Hilbert Symbols}},
  year = {2012},
  eprint = {1204.3115},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1204.3115},
}
Figure