Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Serdica Journal of Computing

Some new Results for Additive Self-Dual Codes over GF(4)

Zlatko Varbanov

Published Jul 4, 2007• 11 citations
Publisher

Abstract

Additive code C over GF(4) of length n is an additive subgroup of GF(4)n. It is well known [4] that the problem of finding stabilizer quantum error-correcting codes is transformed into problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to construct good additive self-dual codes of length 13 ≤ n ≤ 21. In this paper we classify all extremal (optimal) codes of lengths 13 and 14, and we construct many extremal codes of lengths 15 and 16. Also, we construct some new extremal codes of lengths 17,18,19, and 21. We give the current status of known extremal (optimal) additive self-dual codes of lengths 13 to 21.

DOI
10.55630/sjc.2007.1.213-227

Related papers

Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<

Thomas Aaron Gulliver, J.-L. Kim

It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.

IEEE Transactions on Information Theory•Feb 1, 2004•27 citations

On the classification of Hermitian self-dual additive codes over GF(9)

Lars Eirik Danielsen

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.

arXiv:1106.2428•Jun 13, 2011•0 citations

On Additive GF(4) Codes

Philippe Gaborit, W. Cary Huffman, Jon-Lark Kim +1 more

. In this paper we discuss the status of the classication of the extremal additive codes over GF (4) which are self-dual under the trace inner product. These codes are of interest because of their connection to quantum codes. There are 5 inequivalent codes of length 8, 8 of length 9, at least 56 of length 10, and exactly 1 of length 11. We discuss the methods of classication, the concepts of lengthening and shortening, and connections to binary codes. 1. Introduction An additive code C over GF (4) of length n is an additive subgroup of GF (4) n . As C is a free GF(2)-module, it has size 2 k for some 0 k 2n. We call C an (n; 2 k ) code. It has a basis, as a GF(2)-module, consisting of k basis vectors; a generator matrix of C will be a k n matrix with entries in GF (4) whose rows are a basis of C. Interest in additive codes over GF (4) has arisen because of their correspondence to quantum codes as described in [3]. There is a natural inner product arising from the trace m...

•Jan 1, 2001•29 citations

Quantum stabilizer codes construction from Hermitian self-orthogonal codes over GF(4)

Duc Manh Nguyen, Sunghwan Kim

In order to construct quantum error correction code, we consider additive codes over Galois field GF(4), which are self-orthogonal with respect to a certain Hermitian product. In this paper, we first propose a new approach to the construction of Hermitian self-orthogonal linear codes, applying the extension to get a longer length, and prove the codes have good minimum distance. Then, we investigate the corresponding quantum stabilizer codes from the classical codes. Six optimal quantum stabilizer codes have been achieved to show the effectiveness of the proposed construction.

Journal of Communications and Networks•Jun 1, 2018•18 citations

Quantum error correction via codes over GF(4)

A.R. Calderbank, Eric M. Rains, Peter W. Shor +1 more

The problem of finding quantum error correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

IEEE Transactions on Information Theory•Jul 1, 1998•1,748 citations

Quantum stabilizer codes based on a new construction of self-orthogonal trace-inner product codes over GF(4)

Duc Manh Nguyen, Sunghwan Kim

In this paper, we propose quantum stabilizer codes based on a new construction of self-orthogonal trace-inner product codes over the Galois field with 4 elements (GF(4)). First, from any two binary vectors, we construct a generator matrix of linear codes whose components are over GF(4). We prove that the proposed linear codes comply with the self-orthogonal, trace-inner product. Then, we propose mapping tables to construct new quantum stabilizer codes by using linear codes. Comparison results show that our proposed quantum codes have various dimensions for any code length with the capacity for better errors correction relative to the referenced quantum codes.

International Journal of Modern Physics B•Feb 14, 2020•3 citations
Additive code C over GF(4) of length n is an additive subgroup of GF(4)n. It is well known [4] that the problem of finding stabilizer quantum error-correcting codes is transformed into problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to construct good additive self-dual codes of length 13 ≤ n ≤ 21. In this paper we classify all extremal (optimal) codes of lengths 13 and 14, and we construct many extremal codes of lengths 15 and 16. Also, we construct some new extremal codes of lengths 17,18,19, and 21. We give the current status of known extremal (optimal) additive self-dual codes of lengths 13 to 21.
Circulant Based Extremal Additive Self-Dual Codes Over>tex<hboxGF,(4)hboxGF,(4)hboxGF,(4)>/tex<
It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.
Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.
. In this paper we discuss the status of the classication of the extremal additive codes over GF (4) which are self-dual under the trace inner product. These codes are of interest because of their connection to quantum codes. There are 5 inequivalent codes of length 8, 8 of length 9, at least 56 of length 10, and exactly 1 of length 11. We discuss the methods of classication, the concepts of lengthening and shortening, and connections to binary codes. 1. Introduction An additive code C over GF (4) of length n is an additive subgroup of GF (4) n . As C is a free GF(2)-module, it has size 2 k for some 0 k 2n. We call C an (n; 2 k ) code. It has a basis, as a GF(2)-module, consisting of k basis vectors; a generator matrix of C will be a k n matrix with entries in GF (4) whose rows are a basis of C. Interest in additive codes over GF (4) has arisen because of their correspondence to quantum codes as described in [3]. There is a natural inner product arising from the trace m...
In order to construct quantum error correction code, we consider additive codes over Galois field GF(4), which are self-orthogonal with respect to a certain Hermitian product. In this paper, we first propose a new approach to the construction of Hermitian self-orthogonal linear codes, applying the extension to get a longer length, and prove the codes have good minimum distance. Then, we investigate the corresponding quantum stabilizer codes from the classical codes. Six optimal quantum stabilizer codes have been achieved to show the effectiveness of the proposed construction.
In this paper, we propose quantum stabilizer codes based on a new construction of self-orthogonal trace-inner product codes over the Galois field with 4 elements (GF(4)). First, from any two binary vectors, we construct a generator matrix of linear codes whose components are over GF(4). We prove that the proposed linear codes comply with the self-orthogonal, trace-inner product. Then, we propose mapping tables to construct new quantum stabilizer codes by using linear codes. Comparison results show that our proposed quantum codes have various dimensions for any code length with the capacity for better errors correction relative to the referenced quantum codes.