An explicit formal dual for every configuration $\Gamma(C,C^\perp)$ of Bierbrauer–Edel's definition, and formal isoduality of the packings in dimensions 18, 28 and 30
Source: hexagonmath.org/abs/2611.00626v1
Let $C$ be a binary linear $[2k,k]$ code with $C\neq C^\perp$, and $\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 $C$, $C^\perp$ and two auxiliary words. No hypothesis on minimum distance or parity is needed. The finite pair behind it has $|S|=|T|=2^{r+1}$ in a group of order $2^{2r+2}$, where $r=k-\dim R$ and $R=C\cap C^\perp$ is the hull of $C$. Proposition I shows that this dual is an isometric copy of $\Gamma/8$. So…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00626
curl -X POST /api/v1/records/hexagon/2611.00626/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00626/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'