• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

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

by L E Danielsen
Venue:Adv. Math. Commun
Add To MetaCart

Tools

Sorted by:
Results 1 - 8 of 8

Directed Graph Representation of Half-Rate Additive Codes over GF(4)

by Lars Eirik Danielsen, Matthew G. Parker
"... Abstract. We show that (n, 2 n, d) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation greatly reduces the complexity of code classification, and enables ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Abstract. We show that (n, 2 n, d) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation greatly reduces the complexity of code classification, and enables us to classify additive (n, 2 n, d) codes over GF(4) of length up to 7. From this we also derive classifications of isodual and formally self-dual codes. We introduce new constructions of circulant and bordered circulant directed graph codes, and show that these codes will always be isodual. A computer search of all such codes of length up to 26 reveals that these constructions produce many codes of high minimum distance. In particular, we find new near-extremal formally self-dual codes of length 11 and 13, and isodual codes of length 24, 25, and 26 with better minimum distance than the best known self-dual codes. 1
(Show Context)

Citation Context

... self-dual codes over GF(4) and lattices has also been shown [9]. We have previously studied the connection between self-dual additive codes over GF (q 2 ), for any prime power q, and weighted graphs =-=[10]-=-. Such generalizationscould also be considered for additive codes in general, but will not be discussed in this paper. Let tn be the number of inequivalent codes of length n. To find one code from ea...

Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes

by Lars Eirik Danielsen, Matthew G. Parker , 2008
"... The interlace polynomial q was introduced by Arratia, Bollobás, and Sorkin. It encodes many properties of the orbit of a graph under edge local complementation (ELC). The interlace polynomial Q, introduced by Aigner and van der Holst, similarly contains information about the orbit of a graph under l ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
The interlace polynomial q was introduced by Arratia, Bollobás, and Sorkin. It encodes many properties of the orbit of a graph under edge local complementation (ELC). The interlace polynomial Q, introduced by Aigner and van der Holst, similarly contains information about the orbit of a graph under local complementation (LC). We have previously classified LC and ELC orbits, and now give an enumeration of the corresponding interlace polynomials of all graphs of order up to 12. An enumeration of all circle graphs of order up to 12 is also given. We show that there exist graphs of all orders greater than 9 with interlace polynomials q whose coefficient sequences are non-unimodal, thereby disproving a conjecture by Arratia et al. We have verified that for graphs of order up to 12, all polynomials Q have unimodal coefficients. It has been shown that LC and ELC orbits of graphs correspond to equivalence classes of certain error-correcting codes and quantum states. We show that the properties of these codes and quantum states are related to properties of the associated interlace polynomials. 1
(Show Context)

Citation Context

...erlace polynomials Q of graphs corresponding to the best known self-dual quantum codes, obtained from http://www.codetables.de/ and from a search we have previously performed of circulant graph codes =-=[8]-=-. The results, for graphs of order n up to 25, are given in Table 6. Values printed in bold font are the best values we have found, and are thus lower bounds on the minimum possible values of deg(Q) a...

Additive circulant graph codes over GF (4)

by Zlatko Varbanov
"... Abstract. In this paper we consider additive circulant graph codes over GF(4) and an algorithm for their construction. Also, we present some new results obtained by this algorithm. 1 ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. In this paper we consider additive circulant graph codes over GF(4) and an algorithm for their construction. Also, we present some new results obtained by this algorithm. 1
(Show Context)

Citation Context

...Several papers (for instance, [4, 6, 7]) were devoted to classifying or constructing additive self-dual codes over GF (4). Additive self-dual codes over GF (9), GF (16) and GF (25) were classified in =-=[5]-=-. Moreover, it was shown in [10] that certain vectors in some additive self-dual codes over GF (4) hold generalized t-designs as well as classical t-designs with possibly repeated blocks. These facts ...

On the Classification of Hermitian Self-Dual Additive Codes over GF(9)

by Lars Eirik Danielsen , 2011
"... 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 ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
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.

On the Classification of Self-Dual Additive Codes over GF(9)

by Lars Eirik Danielsen
"... Abstract—Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have previously been classified up to length 8. In this paper, all codes of length 9 and 10 are classified, using a new algorithm that combines two graph representations of codes. First, the searc ..."
Abstract - Add to MetaCart
Abstract—Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have previously been classified up to length 8. In this paper, all codes of length 9 and 10 are classified, using a new algorithm that combines two graph representations of codes. First, the search space is reduced by the fact that every self-dual additive code can be mapped to a weighted graph. Then a different graph is described that transforms the problem of code equivalence into a problem of graph isomorphism. I.
(Show Context)

Citation Context

...replace column ai 1 0 by −bi and bi by ai. In this way, we “swap” the n − k last columns of A and B. It can be shown, from the self-duality of the code, that the new matrix B must have full rank [8], =-=[9]-=-, and the standard form is then obtained as above. It also follows from self-duality that the obtained Γ will always be a symmetric matrix. As an example, consider the (4, 34 , 3) code generated by C ...

and

by Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...ension equal to the rank of A over the binary field (2-rank of A), and minimum distance dn ≤ degmin. Recently, finding optimum codes from graphs had received a wide attention of many researchers, see =-=[4, 5, 6, 7, 8, 9, 10, 16, 17]-=-. In [8], Danielsen and Parker showed that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. They used these ...

and

by Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...and Parker [8] proved that every self2 dual additive code over GF (4) is equivalent to a graph code. Recently, finding optimum codes from graphs has received a wide attention of many researchers, see =-=[4, 5, 6, 7, 8, 9, 10, 16, 17]-=-. In [8], Danielsen and Parker showed that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. They used these ...

ON THE THEORY OF Fq-LINEAR Fq t-CODES

by W. Cary Huffman , 2013
"... In [7], self-orthogonal additive codes over F4 under the trace inner product were connected to binary quantum codes; a similar connection was given in the nonbinary case in [33]. In this paper we consider a natural generalization of additive codes called Fq-linear F q t-codes. We examine a number o ..."
Abstract - Add to MetaCart
In [7], self-orthogonal additive codes over F4 under the trace inner product were connected to binary quantum codes; a similar connection was given in the nonbinary case in [33]. In this paper we consider a natural generalization of additive codes called Fq-linear F q t-codes. We examine a number of classical results from the theory of Fq-linear codes, and see how they must be modified to give analogous results for Fq-linear F q t-codes. Included in the topics examined are the MacWilliams Identities, the Gleason polynomials, the Gleason-Pierce Theorem, Mass Formulas, the Balance Principle, the Singleton Bound, and MDS codes. We also classify certain of these codes for small lengths using the theory developed.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University