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.











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)