Constructing self-dual codes using graphs
From MaRDI portal
This paper gives a new construction of self-dual codes. It is proved that the rows of the face-vertex incidence matrix of a connected cubic planar bipartite graph on \(n\) vertices generates a self-dual binary code of length \(n\). Some relations between the graph and the code obtained from the graph are discussed.
Recommendations
Cites work
- (v, k, λ) Configurations and self-dual codes
- A classification of self-orthogonal codes over GF(2)
- Hadamard matrices and doubly even self-dual error-correcting codes
- scientific article; zbMATH DE number 3756373 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3394154 (Why is no real title available?)
Cited in
(10)- On graphs and codes
- The neighbor graph of binary self-dual codes
- Self-dual codes from 3-class association schemes
- Constructions of binary codes based on bipartite graphs
- scientific article; zbMATH DE number 1028232 (Why is no real title available?)
- scientific article; zbMATH DE number 975362 (Why is no real title available?)
- scientific article; zbMATH DE number 6769199 (Why is no real title available?)
- Isodual and self-dual codes from graphs
- Construction of self dual codes from graphs
- Self-dual codes defined on factor graphs
This page was built for publication: Constructing self-dual codes using graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179477)