Error-correcting codes from graphs
type: Item
instance of: scholarly article
title: Error-correcting codes from graphs
zbMATH Open document ID: 1015.05041
DOI: 10.1016/S0012-365X(02)00513-7
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1839013
zbMATH Keywords: linear binary code
zbMATH Keywords: quantum-error-correcting code
zbMATH Keywords: Gilbert-Varshamov bound
zbMATH Keywords: majority decoding
author: Vladimir D. Tonchev
reviewed by: Ki Hang Kim
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00513-7
OpenAlex ID: W2000056635
Recommended article: Graph theoretic error-correcting codes
Recommended article: On the Number of Errors Correctable with Codes on Graphs
Recommended article: Graph based linear error correcting codes
Recommended article: Q4945360
Recommended article: Q4524330
Recommended article: On the Error-Correcting Capabilities of Cycle Codes of Graphs
Recommended article: Ternary graph theoretic error-correcting codes (Corresp.)
Recommended article: Q5013043
Recommended article: Graph Theoretic Methods in Coding Theory
Recommended article: Error-correcting codes on the Towers of Hanoi graphs
description: scientific article; zbMATH DE number 1839013