Additive codes over $GF(4)$ from circulant graphs
Combinatorics
2014-04-01 v1 Discrete Mathematics
Information Theory
math.IT
Abstract
In , Danielsen and Parker \cite{DP} proved that every self-dual additive code over is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs.
Keywords
Cite
@article{arxiv.1403.7933,
title = {Additive codes over $GF(4)$ from circulant graphs},
author = {Ruihu Li and Xueliang Li and Yaping Mao and Meiqin Wei},
journal= {arXiv preprint arXiv:1403.7933},
year = {2014}
}
Comments
9 pages. arXiv admin note: substantial text overlap with arXiv:1402.6399