The neighbor graph of binary self-dual codes
From MaRDI portal
Publication:2115725
Recommendations
Cites work
- A new upper bound on the minimal distance of self-dual codes
- Algebraic Coding Theory Over Finite Commutative Rings
- Extremal binary self-dual codes
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- Open problems in coding theory
- Self-dual codes and invariant theory
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- The Search for a Finite Projective Plane of Order 10
Cited in
(6)- scientific article; zbMATH DE number 6769199 (Why is no real title available?)
- Isodual and self-dual codes from graphs
- New type I binary \([72, 36, 12]\) self-dual codes from \(M_6(\mathbb{F}_2)G\) -- group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm
- The neighbor graph of binary self-orthogonal codes
- Neighbors of self-dual codes over the non-commutative ring E
- The neighbor graph of linear codes over finite fields
This page was built for publication: The neighbor graph of binary self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115725)