%0 Journal Article
%T Formally self-dual linear binary codes from circulant graphs
%A Ruihu Li
%A Xueliang Li
%A Yaping Mao
%A Meiqin Wei
%J Mathematics
%D 2014
%I arXiv
%X 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.
%U http://arxiv.org/abs/1402.6399v3