Graph-Based Classification of Self-Dual Additive Codes over Finite Fields

Details Graph-Based Classification of Self-Dual Additive Codes over Finite Fields Graph-Based Classification of Self-Dual Additive Codes over Finite Fields

2008-01-24

arxiv.org/abs/0801.3773v3

Adv. Math. Commun. 3(4), pp. 329-348, 2009

Computer Science

Information Theory

20 pages, 13 figures

Scientific paper

10.3934/amc.2009.3.329

Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over GF(4). In this paper we classify self-dual additive codes over GF(9), GF(16), and GF(25). Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over GF(9) by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations.

Affiliated with

Also associated with

No associations

Rating

Graph-Based Classification of Self-Dual Additive Codes over Finite Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph-Based Classification of Self-Dual Additive Codes over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph-Based Classification of Self-Dual Additive Codes over Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-283356