Constructing self-dual codes using graphs (Q1179477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing self-dual codes using graphs |
scientific article; zbMATH DE number 24681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing self-dual codes using graphs |
scientific article; zbMATH DE number 24681 |
Statements
Constructing self-dual codes using graphs (English)
0 references
26 June 1992
0 references
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.
0 references
self-dual code
0 references
self-orthogonal code
0 references
incidence matrix
0 references
cubic planar bipartite graph
0 references
0.8565318584442139
0 references
0.8474560379981995
0 references
0.843329668045044
0 references
