Edge local complementation and equivalence of binary linear codes
From MaRDI portal
Publication:1009082
DOI10.1007/S10623-008-9190-XzbMATH Open1178.94219arXiv0710.2243OpenAlexW2012516225MaRDI QIDQ1009082FDOQ1009082
Authors: Lars Eirik Danielsen, Matthew G. Parker 
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0710.2243
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
- Title not available (Why is that?)
- Quantum error correction via codes over GF(4)
- Classification algorithms for codes and designs
- Multiparty entanglement in graph states
- Graphic presentations of isotropic systems
- Local complementation and interlacement graphs
- Interlace polynomials
- Euler circuits and DNA sequencing by hybridization
- The interlace polynomial of a graph
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Local unitary versus local Clifford equivalence of stabilizer states
- Classifying subspaces of Hamming spaces
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graphs and codes
- Title not available (Why is that?)
Cited In (7)
- Pivots, determinants, and perfect matchings of graphs
- Quantum stabilizer codes, lattices, and CFTs
- Edge local complementation for logical cluster states
- From graph states to two-graph states
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- On graphs and codes preserved by edge local complementation
- Interlace polynomials: enumeration, unimodality and connections to codes
Uses Software
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)
