Error-correcting codes from graphs (Q1850033)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error-correcting codes from graphs |
scientific article |
Statements
Error-correcting codes from graphs (English)
0 references
2 December 2002
0 references
This paper considers linear codes constructed by using the row space of the matrix of an undirected graph, both with the identity matrix row space, and without it. It shows they include codes that attain the Gilbert-Varshamov bound, codes rapidly decodable by majority decoding, and codes usable for quantum-error-correction.
0 references
linear binary code
0 references
quantum-error-correcting code
0 references
Gilbert-Varshamov bound
0 references
majority decoding
0 references
