## Description

Binary linear code whose generator matrix is defined using the adjacency matrix of a graph.

Given an adjacency matrix \(A\), the generator matrix is either \(G=A\) or \(G=(I|A)\), where \(I\) is the identity matrix.

Codes based on strongly regular graphs are sometimes optimal or nearly optimal for their length and size [1].

## Parent

## Cousin

- Hermitian qubit code — Bounds on self-dual \([[n,0,d]]\) codes based on graphs have been derived [2].

## References

## Page edit log

- Victor V. Albert (2024-01-06) — most recent

## Cite as:

“Graph-based code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/graph

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/bits/graph.yml.