Sciweavers

3 search results - page 1 / 1
» Edge local complementation and equivalence of binary linear ...
Sort
View
DCC
2008
IEEE
14 years 4 months ago
Edge local complementation and equivalence of binary linear codes
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...
Lars Eirik Danielsen, Matthew G. Parker
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 4 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
13 years 8 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson