\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2009, Volume 3, Issue 4: 329-348. Doi: 10.3934/amc.2009.3.329
This issue Previous Article Generalized AG convolutional codes Next Article MDS and near-MDS self-dual codes over large prime fields

Graph-based classification of self-dual additive codes over finite fields

  • 1.

    Department of Informatics, University of Bergen, PO Box 7803, N-5020 Bergen

Received:  February 2009
Revised:  September 2009
Published:  November 2009
Abstract Related Papers Cited by
    Abstract
  • Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2. 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.
    Mathematics Subject Classification: Primary: 94B05, 05C30; Secondary: 94B60, 05C50.

    Citation:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

HTML views() PDF downloads(130) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2023 American Institute of Mathematical Sciences