A gluing technique for constructing relatively self-dual codes
From MaRDI portal
Publication:1323836
DOI10.1016/0097-3165(94)90055-8zbMath0806.94023OpenAlexW2009346046MaRDI QIDQ1323836
Publication date: 8 June 1994
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(94)90055-8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On self-dual, doubly even codes of length 32
- On the enumeration of self-dual codes
- Self-dual codes over GF(5)
- On the enumeration of lattices of determinant one
- The friendly giant
- Codes over GF(4) and complex lattices
- Hadamard matrices and doubly even self-dual error-correcting codes
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- A classification of self-orthogonal codes over GF(2)
- The Leech lattice
- Self-dual codes over<tex>GF(7)</tex>(Corresp.)
- Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
- On ternary self-dual codes of length 24
- Twenty-three constructions for the Leech lattice
- Self-Dual Codes over ${\text{GF}}( 3 )$
- The children of the (32, 16) doubly even codes
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- On the uniqueness of the Golay codes
- On the classification and enumeration of self-dual codes
This page was built for publication: A gluing technique for constructing relatively self-dual codes
