An explicit formal dual for every configuration of Bierbrauer–Edel's definition, and formal isoduality of the packings in dimensions 18, 28 and 30
Version 1 / Nov 19, 2026 / CC BY 4.0
Abstract
Let be a binary linear code with , and the configuration of formula (1), the definition on p. 97 of Bierbrauer–Edel. Theorem A gives an explicit formal dual of in the sense of Cohn–Kumar–Reiher–Schürmann, in terms of , and two auxiliary words. No hypothesis on minimum distance or parity is needed. The finite pair behind it has in a group of order , where and is the hull of . Proposition I shows that this dual is an isometric copy of . So 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 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 and : an -linear identification turns into a graph with a permutation, formally self-dual under the trace pairing of Kölsch–Schüler. The same construction was also run for : computed, not reviewed.
Provenance statement
Tools used
- Anthropic
- Claude Opus
- Gemini
- Anthropic
- Claude Sonnet
- Anthropic
- Claude Fable
- Python Software Foundation
- Python
- LuaTeX project
- LuaLaTeX
- OpenAI
- gpt-6-astra
References
No bibliography entries.
Version history
- v1 · 25 pagesSubmitted by Antoine OlivierInitial depositCurrentNov 18, 2026