Edge local complementation and equivalence of binary linear codes

DOI10.1007/S10623-008-9190-XMaRDI QIDQ1009082zbMATH OpenOpenAlexFDO

Authors Lars Eirik Danielsen, Matthew G. Parker

Publication date 31 March 2009

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

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Linear codes (general theory) (94B05)

Abstract: Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. By extending earlier results on local complementation (LC) orbits, we classify the ELC orbits of all graphs on up to 12 vertices. We also give a new method for classifying binary linear codes, with running time comparable to the best known algorithm.

Recommendations

• On graphs and codes preserved by edge local complementation
• Linear-time binary codes correcting localized erasures
• On Linear Complementary Pairs of Codes
• On the equivalence of linear codes
• The minimum locality of linear codes
• Kernelization of edge perfect code and its variants
• On the complete decoding of binary linear codes (Corresp.)
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• On bounded linear codes and the commutative equivalence
• Locality of optimal binary codes

Cites work

• scientific article; zbMATH DE number 4202305 (Why is no real title available?)
• scientific article; zbMATH DE number 1057748 (Why is no real title available?)
• scientific article; zbMATH DE number 1972849 (Why is no real title available?)
• scientific article; zbMATH DE number 758277 (Why is no real title available?)
• Classification algorithms for codes and designs
• Classifying subspaces of Hamming spaces
• Euler circuits and DNA sequencing by hybridization
• Graphic presentations of isotropic systems
• Interlace polynomials
• Local complementation and interlacement graphs
• Local unitary versus local Clifford equivalence of stabilizer states
• Multiparty entanglement in graph states
• On graphs and codes
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• Quantum error correction via codes over GF(4)
• Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
• The interlace polynomial of a graph

Cited in

(7)

• Edge local complementation for logical cluster states
• Interlace polynomials: enumeration, unimodality and connections to codes
• Quantum stabilizer codes, lattices, and CFTs
• Pivots, determinants, and perfect matchings of graphs
• On graphs and codes preserved by edge local complementation
• From graph states to two-graph states
• Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation

Describes a project that uses

Uses Software

• nauty
• OEIS

This page was built for publication: Edge local complementation and equivalence of binary linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009082)