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.