For any simple graph with adjacency matrix A, the code generated by [I_n|A] has minimum distance min_S(|S|+|von(S)|), and is self-dual exactly when A^2 equals the identity matrix over F2.
Switched symplectic graphs and their 2 -ranks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Isodual and Self-dual Codes from Graphs
For any simple graph with adjacency matrix A, the code generated by [I_n|A] has minimum distance min_S(|S|+|von(S)|), and is self-dual exactly when A^2 equals the identity matrix over F2.