Binary codes from the line graph of the n-cube

Authors:
W. Fish;J. D. Key;E. Mwambene
Affiliations:
Department of Mathematics and Applied Mathematics, University of the Western Cape, 7535 Bellville, South Africa;Department of Mathematics and Applied Mathematics, University of the Western Cape, 7535 Bellville, South Africa;Department of Mathematics and Applied Mathematics, University of the Western Cape, 7535 Bellville, South Africa
Venue:
Journal of Symbolic Computation
Year:
2010

Citing 5
Cited 2

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Partial permutation decoding for codes from finite planes

European Journal of Combinatorics
Binary codes from rectangular lattice graphs and permutation decoding

European Journal of Combinatorics
Minimal permutation sets for decoding the binary Golay codes (Corresp.)

IEEE Transactions on Information Theory
Information sets and partial permutation decoding for codes from finite geometries

Finite Fields and Their Applications

Codes associated with triangular graphs and permutation decoding

International Journal of Information and Coding Theory
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine designs and binary codes associated with the line graph of the n-cube Q"n, 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.