Permutation decoding for binary codes from lattice graphs (Q924975)

The binary codes formed from the row span of adjacency matrices for the lattice graphs have been examined by \textit{V. D. Tonchev} [Combinatorial configurations, designs, codes, graphs. Transl. from the Bulgarian by Robert A. Melter. New York: John Wiley \& Sons (1988; Zbl 0643.05002)] and \textit{W. H. Haemers, R. Peeters} and \textit{J. M. van Rijckevorsel} [Des. Codes Cryptography 17, No.~1--3, 187--209 (1999; Zbl 0938.05062). The dimension and weight enumerator of these codes can be easily determined. In this paper, by finding explicit PD sets, the authors show that permutation decoding can be used for the binary code obtained from the row span over the field \(\mathbb{F}_2\) of an adjacency matrix of the lattice graph \(L_2(n)\) for any \(n \geq 5\).