Higman-Sims graph-adjacency code

Higman-Sims graph-adjacency code[1,2]

Description

A graph-based code whose generator matrix is constructed using the adjacency matrix \(A\) of the Higman-Sims graph. Setting the generator matrix \(G=(I|A)\) yields a \([100,22,32]\) code whose dual is an optimal \([100,78,8]\) code [1; Table VI].

Parent

Graph-adjacency code

Cousin

Combinatorial design — Codewords of weight 36 of the Higman-Sims graph-adjacency code form a \(2\)-\((100,36,525)\) design [1; Remark 1.7]

References

[1]: V. D. Tonchev, “Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs”, IEEE Transactions on Information Theory 43, 1021 (1997) DOI
[2]: V. D. Tonchev, “Error-correcting codes from graphs”, Discrete Mathematics 257, 549 (2002) DOI

Page edit log

Victor V. Albert (2024-03-21) — most recent

Cite as:

“Higman-Sims graph-adjacency code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/higman-sims_graph

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