Isodual and Self-dual Codes from Graphs
From MaRDI portal
Publication:5862397
zbMath1501.94093arXiv1908.03513MaRDI QIDQ5862397
No author found.
Publication date: 9 March 2022
Full work available at URL: https://arxiv.org/abs/1908.03513
Related Items
Cites Work
- Unnamed Item
- Switched symplectic graphs and their 2-ranks
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- A characterization of graphs by codes from their incidence matrices
- Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Rank-3 graphs, block designs, and codes with unequal symbol protection
- \(LCD\) codes from adjacency matrices of graphs
- Error-correcting codes from graphs
- Chromatic number and the 2-rank of a graph
- Classes of graphs with minimum skew rank 4
- Binary codes from the complements of the triangular graphs
- Codes on Graphs: Fundamentals
- Shadow bounds for self-dual codes
This page was built for publication: Isodual and Self-dual Codes from Graphs
