Permutation decoding for binary codes from some regular graphs and designs

چکیده مقاله

The permutation decoding and finding PD-sets is an important method for error-correcting. It can be usefull when a linear code has a sufficiently large automorphism group. In this paper, PD-sets for some binary codes obtained from the adjacency matrices of some classes of graphs are given.