Sciweavers

14 search results - page 1 / 3
» Codes from lattice and related graphs, and permutation decod...
Sort
View
DAM
2010
107views more  DAM 2010»
13 years 5 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
EJC
2007
13 years 5 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 permut...
Jennifer D. Key, P. Seneviratne
JSC
2010
132views more  JSC 2010»
13 years 4 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
13 years 11 months ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap
ARSCOM
2006
91views more  ARSCOM 2006»
13 years 5 months ago
Binary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...