Binary codes from rectangular lattice graphs and permutation decoding

Authors:
J. D. Key;P. Seneviratne
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Department of Mathematical Sciences, Clemson University, Clemson, SC
Venue:
European Journal of Combinatorics
Year:
2007

Citing 4
Cited 3

Designs and their codes

Designs and their codes
Permutation decoding for the binary codes from triangular graphs

European Journal of Combinatorics
Partial permutation decoding for codes from finite planes

European Journal of Combinatorics
Information sets and partial permutation decoding for codes from finite geometries

Finite Fields and Their Applications

Automorphism groups of cyclic codes

Journal of Algebraic Combinatorics: An International Journal
Binary codes from the line graph of the n-cube

Journal of Symbolic Computation
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(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.