Edge Local Complementation and Equivalence of Binary Linear Codes

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Presented at International Workshop on Coding and Cryptography (WCC 2007), 16-20 Apr. 2007, Versailles, France. (12 pages, 3 f

Scientific paper

10.1007/s10623-008-9190-x

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Edge Local Complementation and Equivalence of Binary Linear Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Edge Local Complementation and Equivalence of Binary Linear Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge Local Complementation and Equivalence of Binary Linear Codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-541884

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.