Binary codes from rectangular lattice graphs and permutation decoding

We examine the binary codes obtained from the row span over the field F 2 of an adjacency matrix of the rectangular lattice graphs L 2 ( m , n ) for 3 ≤ m < n and show that permutation decoding can be used for full error-correction for these codes by finding explicit information sets and PD-sets for these information sets.