A gluing technique for constructing relatively self-dual codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3891251 (Why is no real title available?)
- scientific article; zbMATH DE number 4057782 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 1867238 (Why is no real title available?)
- A classification of self-orthogonal codes over GF(2)
- Codes over GF(4) and complex lattices
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Hadamard matrices and doubly even self-dual error-correcting codes
- On self-dual, doubly even codes of length 32
- On ternary self-dual codes of length 24
- On the classification and enumeration of self-dual codes
- On the enumeration of lattices of determinant one
- On the enumeration of self-dual codes
- On the uniqueness of the Golay codes
- Self-Dual Codes over ${\text{GF}}( 3 )$
- Self-dual codes over GF(5)
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- 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
- The Leech lattice
- The children of the (32, 16) doubly even codes
- The friendly giant
- Twenty-three constructions for the Leech lattice
This page was built for publication: A gluing technique for constructing relatively self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323836)