Edge local complementation and equivalence of binary linear codes

Designs, Codes, and Cryptography

Volumn 49, Issue 1-3, 2008, Pages 161-170

  Danielsen, Lars Eirik ^a   Parker, Matthew G ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Binary linear codes; Classification; Edge local complementation; Graphs

Indexed keywords

CRYPTOGRAPHY; EQUIVALENCE CLASSES; GRAPH THEORY; PROGRAMMING THEORY; SET THEORY;

BINARY LINEAR CODES; CLASSIFICATION; COMPLEMENTATION; EDGE LOCAL COMPLEMENTATION; GRAPHS;

ORBITS;

EID: 51349111345     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-008-9190-x     Document Type: Article

References (22)

1. Aigner M., van der Holst H. (2004). Interlace polynomials. Linear Algebra Appl. 377, 11-30
2. Arratia R., Bollobás B., Coppersmith D., Sorkin G.B. (2000). Euler circuits and DNA sequencing by hybridization. Discrete Appl. Math. 104(1-3): 63-96
3. Arratia R., Bollobás B., Sorkin G.B. (2004). The interlace polynomial of a graph. J. Combin. Theory Ser. B 92(2): 199-233, arXiv:math.CO/0209045
4. Bouchet A. (1988). Graphic presentations of isotropic systems. J. Combin. Theory Ser. B 45(1): 58-76
5. Calderbank A.R., Rains E.M., Shor P.M., Sloane N.J.A. (1998). Quantum error correction via codes over GF(4). IEEE Trans. Inform. Theory 44(4): 1369-1387, arXiv:quant-ph/9608006
6. Curtis R.T. (1992). On graphs and codes. Geom. Dedicata 41(2): 127-134
7. Danielsen L.E.: On self-dual quantum codes, graphs, and Boolean functions. Master's thesis, Department of Informatics, University of Bergen, Norway (2005). arXiv:quant-ph/0503236.
8. n transform. In: Sequences and their applications - SETA 2004, Lecture Notes in Comput. Sci., vol. 3486, pp. 373-388. Springer-Verlag, Berlin (2005). arXiv:cs.IT/0504102.
9. Danielsen L.E., Parker M.G. (2006). On the classification of all self-dual additive codes over GF(4) of length up to 12. J. Combin. Theory Ser. A 113(7): 1351-1367, arXiv:math.CO/0504522
10. de Fraysseix H. (1981). Local complementation and interlacement graphs. Discrete Math. 33(1): 29-35
11. Fon-der Flaas D.G.: On local complementations of graphs. In: Combinatorics (Eger, 1987), Colloq. Math. Soc. János Bolyai, vol. 52, pp. 257-266. North-Holland, Amsterdam (1988).
12. Fripertinger H., Kerber A.: Isometry classes of indecomposable linear codes. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Comput. Sci., vol. 948, pp. 194-204. Springer-Verlag, Berlin (1995).
13. Glynn D.G., Gulliver T.A., Maks J.G., Gupta M.K.: The geometry of additive quantum codes (2004). Submitted to Springer-Verlag.
14. Hein M., Eisert J., Briegel H.J. (2004). Multi-party entanglement in graph states. Phys. Rev. A 69(6): 062,311, arXiv:quant-ph/0307130
15. Kaski P., Östergård P.R.J. (2006). Classification algorithms for codes and designs, Algorithms and Computation in Mathematics, vol. 15. Springer-Verlag, Berlin
16. McKay B.D.: nauty User's Guide (2003). http://cs.anu.edu.au/~bdm/nauty/.
17. Östergård P.R.J. (2002). Classifying subspaces of Hamming spaces. Des. Codes Cryptogr. 27(3): 297-305
18. Parker M.G., Rijmen V.: The quantum entanglement of binary and bipolar sequences. In: Sequences and their Applications - SETA '01, Discrete Math. Theor. Comput. Sci., pp. 296-309. Springer-Verlag, London (2002). arXiv:quant-ph/0107106.
19. Riera C., Parker M.G.: On pivot orbits of Boolean functions. In: Fourth International Workshop on Optimal Codes and Related Topics, pp. 248-253. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia (2005).
20. Sloane N.J.A., Plouffe S. (1995). The Encyclopedia of Integer Sequences. Academic Press, San Diego, CA
21. Van den Nest M., De Moor B.: Edge-local equivalence of graphs (2005). Preprint, arXiv:math.CO/ 0510246.
22. Van den Nest M., Dehaene J., De Moor B. (2004). Graphical description of the action of local Clifford transformations on graph states. Phys. Rev. A 69(2): 022,316, arXiv:quant-ph/030815