Sciweavers

Share
EJC
2007

Binary codes from rectangular lattice graphs and permutation decoding

10 years 1 months ago
Binary codes from rectangular lattice graphs and permutation decoding
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. Key words: Codes, graphs, designs PACS: 05, 51, 94
Jennifer D. Key, P. Seneviratne
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where EJC
Authors Jennifer D. Key, P. Seneviratne
Comments (0)
books