Error-correcting codes from graphs
Copyright policy )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.
- Michigan Technological University United States
majority decoding, Graphs and linear algebra (matrices, eigenvalues, etc.), Gilbert-Varshamov bound, linear binary code, quantum-error-correcting code, Applications of graph theory, Discrete Mathematics and Combinatorics, Linear codes (general theory), Theoretical Computer Science
majority decoding, Graphs and linear algebra (matrices, eigenvalues, etc.), Gilbert-Varshamov bound, linear binary code, quantum-error-correcting code, Applications of graph theory, Discrete Mathematics and Combinatorics, Linear codes (general theory), Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).18 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!