Edge local complementation and equivalence of binary linear codes
From MaRDI portal
Publication:1009082
DOI10.1007/s10623-008-9190-xzbMath1178.94219arXiv0710.2243OpenAlexW2012516225MaRDI QIDQ1009082
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
Related Items (7)
Edge local complementation for logical cluster states ⋮ Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ On graphs and codes preserved by edge local complementation ⋮ Pivots, determinants, and perfect matchings of graphs ⋮ Quantum stabilizer codes, lattices, and CFTs ⋮ From graph states to two-graph states
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The interlace polynomial of a graph
- Classification algorithms for codes and designs
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Graphic presentations of isotropic systems
- Local complementation and interlacement graphs
- On graphs and codes
- Interlace polynomials
- Euler circuits and DNA sequencing by hybridization
- Classifying subspaces of Hamming spaces
- Local unitary versus local Clifford equivalence of stabilizer states
- Multiparty entanglement in graph states
- 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
This page was built for publication: Edge local complementation and equivalence of binary linear codes