The neighbor graph of binary self-dual codes
From MaRDI portal
Publication:2115725
Recommendations
- Isodual and self-dual codes from graphs
- scientific article; zbMATH DE number 1028232
- Permutation decoding for binary self-dual codes from the graph \(Q_n\) where \(n\) is even
- Constructing self-dual codes using graphs
- Type I neighbors of extremal Type II codes of length 40 derived from Hadamard matrices
Cites work
- 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 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- 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
- Open problems in coding theory
- Self-dual codes and invariant theory
- The Search for a Finite Projective Plane of Order 10
Cited in
(3)- 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
- Isodual and self-dual codes from graphs
- scientific article; zbMATH DE number 6769199 (Why is no real title available?)
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)