Error-correcting codes from graphs
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.
scientific article; zbMATH DE number 1839013