Formally self-dual linear binary codes from circulant graphs

Authors Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei

Publication date 25 February 2014

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Linear codes (general theory) (94B05)

Abstract: In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.

This page was built for publication: Formally self-dual linear binary codes from circulant graphs

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