Equivalent circulant graphs associated with a binary cyclic code

MaRDI QIDQ5745442zbMATH OpenFDO

Authors George Mathew

Publication date 5 June 2018

zbMATH Keywords

adjacency matrixCayley graphscirculant graphscyclic codesgenerator matrixgenerator polynomial

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Directed circulant graphs and binary cyclic codes
• Codes associated with circulant graphs and permutation decoding
• Properties and parameters of codes from line graphs of circulant graphs
• Circulant graphs, lattices and spherical codes
• scientific article; zbMATH DE number 975345

Cited in

(4)

• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Circulant graphs, lattices and spherical codes
• Directed circulant graphs and binary cyclic codes
• Properties and parameters of codes from line graphs of circulant graphs

This page was built for publication: Equivalent circulant graphs associated with a binary cyclic code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745442)