An explicit formal dual for every configuration Γ(C,C⊥)\Gamma(C,C^\perp) of Bierbrauer–Edel's definition, and formal isoduality of the packings in dimensions 18, 28 and 30

Primarily AI-generated textHuman understanding: some partsmath.MG — Metric Geometrymath.CO — Combinatoricsmath.IT — Information Theory

Contributed by Antoine Olivier ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

Let CC be a binary linear [2k,k][2k,k] code with C≠C⊥C\neq C^\perp, and Γ=Γ(C,C⊥)\Gamma=\Gamma(C,C^\perp) the configuration of formula (1), the definition on p. 97 of Bierbrauer–Edel. Theorem A gives an explicit formal dual of Γ\Gamma in the sense of Cohn–Kumar–Reiher–Schürmann, in terms of CC, C⊥C^\perp and two auxiliary words. No hypothesis on minimum distance or parity is needed. The finite pair behind it has ∣S∣=∣T∣=2r+1|S|=|T|=2^{r+1} in a group of order 22r+22^{2r+2}, where r=k−dim⁡Rr=k-\dim R and R=C∩C⊥R=C\cap C^\perp is the hull of CC. Proposition I shows that this dual is an isometric copy of Γ/8\Gamma/8. So Γ\Gamma rescaled to unit density is formally isodual in the sense of Cohn–Kumar–Schürmann. A remark shows that it is formally self-dual exactly when 4∣n4\mid n and the hull is doubly even. Hence the packings 18.1, 28.1 and 30.1 are formally isodual and not formally self-dual. A further remark concerns codes with 1∈R\mathbf 1\in R and r=4,6,8r=4,6,8: an F2\mathbb F_2-linear identification turns SS into a graph {(x,F(x)):x∈F2r+1}\{(x,F(x)) : x\in\mathbb F_{2^{r+1}}\} with FF a permutation, formally self-dual under the trace pairing of Kölsch–Schüler. The same construction was also run for r=10,12r=10,12: computed, not reviewed.

Provenance statement

The theorems, proofs, computations, literature searches and the text of this note were produced by AI agents: Anthropic Claude models (Opus, Sonnet and Fable, as recorded in the orchestration log) run in Claude Code, between 16 and 18 November 2026. The agents asked the author multiple-choice questions along the way. The author, Antoine Olivier, read the statements and redid the example of Section 2.5 by hand; he did not check the proofs. The decisions to pursue this family of configurations and to submit are his. Theorem A was also reviewed on 18 November by GPT-6 Astra (OpenAI), run through Codex, and the note was read once as a hostile referee by Gemini 4 Carbon (Google), run through OpenRouter; both are reviewers from other model families and judged the statements correct, with the reservations given in Section 9 of the note. The other reviews cited in the note were made by fresh Claude instances that did not write the proofs; they are not human referees. No human has checked the proofs. Computations used exact integer or rational arithmetic on a local PC; scripts and outputs are not deposited here.

Tools used

Anthropic
Claude Opus
Google
Gemini
Anthropic
Claude Sonnet
Anthropic
Claude Fable
Python Software Foundation
Python
LuaTeX project
LuaLaTeX
OpenAI
gpt-6-astra

References

No bibliography entries.

Version history

  1. v1 · 25 pagesSubmitted by Antoine OlivierInitial depositCurrentNov 18, 2026