DMCA
Graph-based classification of self-dual additive codes over finite fields (2009)
Cached
Download Links
- [arxiv.org]
- [arxiv.org]
- [www.ii.uib.no]
- [www.ii.uib.no]
- [www.ii.uib.no]
- DBLP
Other Repositories/Bibliography
| Venue: | Adv. Math. Commun |
| Citations: | 8 - 4 self |
BibTeX
@ARTICLE{Danielsen09graph-basedclassification,
author = {Lars Eirik Danielsen},
title = {Graph-based classification of self-dual additive codes over finite fields},
journal = {Adv. Math. Commun},
year = {2009},
pages = {329--348}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Quantum stabilizer states over Fm can be represented as self-dual additive codes over F 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 F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over F9 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. 1.
Keyphrases
self-dual additive code graph-based classification finite field regular graph representation minimum distance computer search minimum vertex degree associated graph orbit generalized local complementation operation correspond selfdual additive code circulant graph code many strong code extension technique self-dual additive md code classical md conjecture quantum stabilizer state weighted graph
