On graphs and codes preserved by edge local complementation

DOI10.1007/s10623-013-9876-6zbMath1342.94112arXiv1006.5802OpenAlexW2137967397MaRDI QIDQ2260792

Joakim Grahl Knudsen, Constanza Riera, Matthew G. Parker, Lars Eirik Danielsen

Publication date: 12 March 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.5802

zbMATH Keywords

graphsisomorphismbinary linear codespivotedge local complementation

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The interlace polynomial of a graph
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• Interlace polynomials: enumeration, unimodality and connections to codes
• Edge local complementation and equivalence of binary linear codes
• Graphic presentations of isotropic systems
• Local complementation and interlacement graphs
• On graphs and codes
• Circle graph obstructions
• Interlace polynomials
• Euler circuits and DNA sequencing by hybridization
• An enumeration of binary self-dual codes of length 32
• Multiparty entanglement in graph states
• Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
• Generalized Bent Criteria for Boolean Functions (I)
• Circle graph obstructions under pivoting
• Quantum error correction via codes over GF(4)
• Distance Hereditary Graphs and the Interlace Polynomial

This page was built for publication: On graphs and codes preserved by edge local complementation