{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:21:51Z","timestamp":1649161311857},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,26]],"date-time":"2013-09-26T00:00:00Z","timestamp":1380153600000},"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":[[2015,3]]},"DOI":"10.1007\/s10623-013-9876-6","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T12:37:35Z","timestamp":1380112655000},"page":"601-621","source":"Crossref","is-referenced-by-count":0,"title":["On graphs and codes preserved by edge local complementation"],"prefix":"10.1007","volume":"74","author":[{"given":"Lars Eirik","family":"Danielsen","sequence":"first","affiliation":[]},{"given":"Matthew G.","family":"Parker","sequence":"additional","affiliation":[]},{"given":"Constanza","family":"Riera","sequence":"additional","affiliation":[]},{"given":"Joakim Grahl","family":"Knudsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,26]]},"reference":[{"key":"9876_CR1","unstructured":"Kotzig A.: Eulerian lines in finite 4-valent graphs and their transformations. In: Theory of Graphs. Proceedings of the Colloquium, Tihany, 1966, pp. 219\u2013230. Academic Press, New York (1968)."},{"key":"9876_CR2","unstructured":"de Fraysseix H.: Local complementation and interlacement graphs. Discret. Math. 33(1), 29\u201335 (1981)."},{"key":"9876_CR3","unstructured":"Fon-der Flaas D.G.: On local complementations of graphs. In: Combinatorics, Eger, 1987. Colloquium of the Mathematical Society of J\u00e1nos Bolyai, vol. 52, pp. 257\u2013266. North-Holland, Amsterdam (1988)."},{"key":"9876_CR4","unstructured":"Bouchet A.: Graphic presentations of isotropic systems. J. Comb. Theory Ser. B 45(1), 58\u201376 (1988)."},{"key":"9876_CR5","doi-asserted-by":"crossref","unstructured":"Hein M., Eisert J., Briegel H.J.: Multi-party entanglement in graph states. Phys. Rev. A 69(6), 062311 (2004).","DOI":"10.1103\/PhysRevA.69.062311"},{"key":"9876_CR6","doi-asserted-by":"crossref","unstructured":"Van den Nest M., Dehaene J., De Moor B.: Graphical description of the action of local Clifford transformations on graph states. Phys. Rev. A 69(2), 022316 (2004).","DOI":"10.1103\/PhysRevA.69.022316"},{"key":"9876_CR7","unstructured":"Calderbank A.R., Rains E.M., Shor P.M., Sloane N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inf. Theory 44(4), 1369\u20131387 (1998)."},{"key":"9876_CR8","unstructured":"Danielsen L.E., Parker M.G.: On the classification of all self-dual additive codes over GF(4) of length up to 12. J. Comb. Theory Ser. A 113(7), 1351\u20131367 (2006)."},{"key":"9876_CR9","unstructured":"Riera C., Parker M.G.: On pivot orbits of Boolean functions. In: Proceedings of the Fourth International Workshop on Optimal Codes and Related Topics, pp. 248\u2013253. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia (2005)."},{"key":"9876_CR10","unstructured":"Riera C., Parker M.G.: Generalised bent criteria for Boolean functions (I). IEEE Trans. Inf. Theory 52(9), 4142\u20134159 (2006)."},{"key":"9876_CR11","doi-asserted-by":"crossref","unstructured":"Aigner M., van der Holst H.: Interlace polynomials. Linear Algebra Appl. 377, 11\u201330 (2004).","DOI":"10.1016\/j.laa.2003.06.010"},{"key":"9876_CR12","unstructured":"Arratia R., Bollob\u00e1s B., Sorkin G.B.: The interlace polynomial of a graph. J. Comb. Theory Ser. B 92(2), 199\u2013233 (2004)."},{"key":"9876_CR13","unstructured":"Arratia R., Bollob\u00e1s B., Coppersmith D., Sorkin G.B.: Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. 104, 63\u201396 (2000)."},{"key":"9876_CR14","unstructured":"Danielsen L.E., Parker M.G.: Interlace polynomials: enumeration, unimodality, and connections to codes. Discret. Appl. Math. 158(6), 636\u2013648 (2010)."},{"key":"9876_CR15","unstructured":"Bouchet A.: Circle graph obstructions. J. Comb. Theory Ser. B 60(1), 107\u2013144 (1994)."},{"key":"9876_CR16","doi-asserted-by":"crossref","unstructured":"Geelen J., Oum S.: Circle graph obstructions under pivoting. J. Graph Theory 61(1), 1\u201311 (2009).","DOI":"10.1002\/jgt.20363"},{"key":"9876_CR17","doi-asserted-by":"crossref","unstructured":"Danielsen L.E., Parker M.G.: Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. 49, 161\u2013170 (2008).","DOI":"10.1007\/s10623-008-9190-x"},{"key":"9876_CR18","unstructured":"Knudsen J.G., Riera C., Parker M.G., Rosnes E.: Adaptive soft-decision iterative decoding using edge local complementation. In: Second International Castle Meeting on Coding Theory and Applications\u2014ICMCTA 2008. Lecture Notes in Computer Science, vol. 5228, pp. 82\u201394. Springer, Berlin (2008)."},{"key":"9876_CR19","unstructured":"Knudsen J.G., Riera C., Danielsen L.E., Parker M.G., Rosnes E.: Iterative decoding on multiple Tanner graphs using random edge local complementation. In: Proceedings of the IEEE International Symposium on Information Theory, Seoul, pp. 899\u2013903 (2009)."},{"key":"9876_CR20","unstructured":"Knudsen J.G., Riera C., Danielsen L.E., Parker M.G., Rosnes E.: Random edge-local complementation with applications to iterative decoding of HDPC codes. Reports in Informatics 395, University of Bergen, August (2010)."},{"key":"9876_CR21","unstructured":"Knudsen J.G., Riera C., Danielsen L.E., Parker M.G., Rosnes E.: Improved adaptive belief propagation decoding using edge-local complementation. In: Proceedings of the IEEE International Symposium on Information Theory, Austin, pp. 774\u2013778 (2010)."},{"key":"9876_CR22","unstructured":"Halford T.R., Chugg K.M.: Random redundant iterative soft-in soft-out decoding. IEEE Trans. Commun. 56(4), 513\u2013517 (2008)."},{"key":"9876_CR23","doi-asserted-by":"crossref","unstructured":"Curtis R.T.: On graphs and codes. Geom. Dedicata 41(2), 127\u2013134 (1992).","DOI":"10.1007\/BF00182413"},{"key":"9876_CR24","unstructured":"Parker M.G., Rijmen V.: The quantum entanglement of binary and bipolar sequences. In: Sequences and Their Applications\u2014SETA \u201901. Discrete Mathematics and Theoretical Computer Science, pp. 296\u2013309. Springer, London (2002)."},{"key":"9876_CR25","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, New York (1998).","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"9876_CR26","unstructured":"Ellis-Monaghan J.A., Sarmiento I.: Distance hereditary graphs and the interlace polynomial. Comb. Probab. Comput. 16(6), 947\u2013973 (2007)."},{"key":"9876_CR27","unstructured":"Pless V.S., Huffman W.C. (eds.): Handbook of Coding Theory. North-Holland, Amsterdam (1998)."},{"key":"9876_CR28","doi-asserted-by":"crossref","unstructured":"Bilous R.T., van Rees G.H.J.: An enumeration of binary self-dual codes of length 32. Des. Codes Cryptogr. 26, 61\u201386 (2002).","DOI":"10.1023\/A:1016544907275"},{"key":"9876_CR29","unstructured":"Bilous R.T.: Enumeration of the binary self-dual codes of length 34. J. Comb. Math. Comb. Comput. 59, 173\u2013211 (2006)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9876-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9876-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9876-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:36Z","timestamp":1559231916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9876-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,26]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9876"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9876-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,26]]}}}