{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T00:23:24Z","timestamp":1773534204730,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T00:00:00Z","timestamp":1204761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10623-008-9190-x","type":"journal-article","created":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T19:52:22Z","timestamp":1204746742000},"page":"161-170","source":"Crossref","is-referenced-by-count":15,"title":["Edge local complementation and equivalence of binary linear codes"],"prefix":"10.1007","volume":"49","author":[{"given":"Lars Eirik","family":"Danielsen","sequence":"first","affiliation":[]},{"given":"Matthew G.","family":"Parker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,6]]},"reference":[{"key":"9190_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.laa.2003.06.010","volume":"377","author":"M. Aigner","year":"2004","unstructured":"Aigner M., van der Holst H. (2004). Interlace polynomials. Linear Algebra Appl. 377, 11\u201330","journal-title":"Linear Algebra Appl."},{"issue":"1\u20133","key":"9190_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0166-218X(00)00190-6","volume":"104","author":"R. Arratia","year":"2000","unstructured":"Arratia R., Bollob\u00e1s B., Coppersmith D., Sorkin G.B. (2000). Euler circuits and DNA sequencing by hybridization. Discrete Appl. Math. 104(1\u20133): 63\u201396","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9190_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.jctb.2004.03.003","volume":"92","author":"R. Arratia","year":"2004","unstructured":"Arratia R., Bollob\u00e1s B., Sorkin G.B. (2004). The interlace polynomial of a graph. J. Combin. Theory Ser. B 92(2): 199\u2013233, arXiv:math.CO\/0209045","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"9190_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0095-8956(88)90055-X","volume":"45","author":"A. Bouchet","year":"1988","unstructured":"Bouchet A. (1988). Graphic presentations of isotropic systems. J. Combin. Theory Ser. B 45(1): 58\u201376","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"9190_CR5","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"A.R. Calderbank","year":"1998","unstructured":"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\u20131387, arXiv:quant-ph\/9608006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9190_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00182413","volume":"41","author":"R.T. Curtis","year":"1992","unstructured":"Curtis R.T. (1992). On graphs and codes. Geom. Dedicata 41(2): 127\u2013134","journal-title":"Geom. Dedicata"},{"key":"9190_CR7","unstructured":"Danielsen L.E.: On self-dual quantum codes, graphs, and Boolean functions. Master\u2019s thesis, Department of Informatics, University of Bergen, Norway (2005). arXiv:quant-ph\/0503236."},{"key":"9190_CR8","unstructured":"Danielsen L.E., Parker M.G.: Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I, H, N} n transform. In: Sequences and their applications \u2013 SETA 2004, Lecture Notes in Comput. Sci., vol. 3486, pp. 373\u2013388. Springer-Verlag, Berlin (2005). arXiv:cs.IT\/0504102."},{"issue":"7","key":"9190_CR9","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/j.jcta.2005.12.004","volume":"113","author":"L.E. Danielsen","year":"2006","unstructured":"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\u20131367, arXiv:math.CO\/0504522","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"9190_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H. Fraysseix de","year":"1981","unstructured":"de Fraysseix H. (1981). Local complementation and interlacement graphs. Discrete Math. 33(1): 29\u201335","journal-title":"Discrete Math."},{"key":"9190_CR11","unstructured":"Fon-der Flaas D.G.: On local complementations of graphs. In: Combinatorics (Eger, 1987), Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 52, pp. 257\u2013266. North-Holland, Amsterdam (1988)."},{"key":"9190_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013204. Springer-Verlag, Berlin (1995).","DOI":"10.1007\/3-540-60114-7_15"},{"key":"9190_CR13","unstructured":"Glynn D.G., Gulliver T.A., Maks J.G., Gupta M.K.: The geometry of additive quantum codes (2004). Submitted to Springer-Verlag."},{"issue":"6","key":"9190_CR14","doi-asserted-by":"crossref","first-page":"062,311","DOI":"10.1103\/PhysRevA.69.062311","volume":"69","author":"M. Hein","year":"2004","unstructured":"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","journal-title":"Phys. Rev. A"},{"key":"9190_CR15","volume-title":"Classification algorithms for codes and designs, Algorithms and Computation in Mathematics, vol. 15","author":"P. Kaski","year":"2006","unstructured":"Kaski P., \u00d6sterg\u00e5rd P.R.J. (2006). Classification algorithms for codes and designs, Algorithms and Computation in Mathematics, vol. 15. Springer-Verlag, Berlin"},{"key":"9190_CR16","unstructured":"McKay B.D.: nauty User\u2019s Guide (2003). http:\/\/cs.anu.edu.au\/~bdm\/nauty\/ ."},{"issue":"3","key":"9190_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1019903407222","volume":"27","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P.R.J. (2002). Classifying subspaces of Hamming spaces. Des. Codes Cryptogr. 27(3): 297\u2013305","journal-title":"Des. Codes Cryptogr."},{"key":"9190_CR18","unstructured":"Parker M.G., Rijmen V.: The quantum entanglement of binary and bipolar sequences. In: Sequences and their Applications \u2013 SETA \u201901, Discrete Math. Theor. Comput. Sci., pp. 296\u2013309. Springer-Verlag, London (2002). arXiv:quant-ph\/0107106."},{"key":"9190_CR19","unstructured":"Riera C., Parker M.G.: On pivot orbits of Boolean functions. In: Fourth International Workshop on Optimal Codes and Related Topics, pp. 248\u2013253. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia (2005)."},{"key":"9190_CR20","volume-title":"The Encyclopedia of Integer Sequences","author":"N.J.A. Sloane","year":"1995","unstructured":"Sloane N.J.A., Plouffe S. (1995). The Encyclopedia of Integer Sequences. Academic Press, San Diego, CA"},{"key":"9190_CR21","unstructured":"Van den Nest M., De Moor B.: Edge-local equivalence of graphs (2005). Preprint, arXiv:math.CO\/ 0510246."},{"issue":"2","key":"9190_CR22","doi-asserted-by":"crossref","first-page":"022,316","DOI":"10.1103\/PhysRevA.69.022316","volume":"69","author":"M. Vanden Nest","year":"2004","unstructured":"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\/0308151","journal-title":"Phys. Rev. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9190-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9190-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9190-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:10Z","timestamp":1559245810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9190-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,6]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9190"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9190-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,6]]}}}