Sciweavers

Share
JSC
2010

Binary codes from the line graph of the n-cube

9 years 10 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 codes. We find a regular subgroup of the automorphism group that can be used for permutation decoding, or partial permutation decoding, for any information set. Key words: Line graph, n-cube, permutation decoding
W. Fish, Jennifer D. Key, E. Mwambene
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where JSC
Authors W. Fish, Jennifer D. Key, E. Mwambene
Comments (0)
books