Additive codes over GF(4) from circulant graphs

MaRDI QIDQ6250300zbMATH OpenFDO

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

Publication date 31 March 2014

Mathematics Subject Classification ID

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

Abstract: In $2006$, Danielsen and Parker cite{DP} proved that every self-dual additive code over $GF(4)$ 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.

This page was built for publication: Additive codes over $GF(4)$ from circulant graphs

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