Formally self-dual linear binary codes from circulant graphs
Combinatorics
2014-04-01 v3 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1402.6399,
title = {Formally self-dual linear binary codes from circulant graphs},
author = {Ruihu Li and Xueliang Li and Yaping Mao and Meiqin Wei},
journal= {arXiv preprint arXiv:1402.6399},
year = {2014}
}
Comments
15 pages