Codes from Circulant Graphs
Abstract: Linear codes from neighborhood designs of strongly regular graphs such as triangular, lattice and Paley graphs have been extensively studied over the past decade. Most of these families of graphs are line graphs of a much larger class known as circulant graphs, Γn(S). In this project we extend earlier results to obtain properties and parameters of binary codes Cn(S) from neighborhood designs of line graphs of circulant graphs.
Jennifer Melendez* and Alexander Westbrooks
Judging Forms – Official judges only