The neighbor graph of binary self-dual codes
From MaRDI portal
Publication:2115725
DOI10.1007/s10623-021-00985-2zbMath1485.94154OpenAlexW4207031357WikidataQ114849837 ScholiaQ114849837MaRDI QIDQ2115725
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00985-2
Applications of graph theory (05C90) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-dual codes and invariant theory
- A new upper bound on the minimal distance of self-dual codes
- Fundamentals of Error-Correcting Codes
- The Search for a Finite Projective Plane of Order 10
- Extremal binary self-dual codes
- Algebraic Coding Theory Over Finite Commutative Rings
This page was built for publication: The neighbor graph of binary self-dual codes