On transitive uniform partitions of F^n into binary Hamming codes

Abstract

We investigate transitive uniform partitions of the vector space $F^n$ of dimension $n$ over the Galois field $GF(2)$ into cosets of Hamming codes. A partition $P^n=\{H_0,H_1+e_1,\dots ,H_n+e_n\}$ of $F^n$ into cosets of Hamming codes $H_0,H_1,\dots ,H_n$ of length $n$ is said to be uniform if the intersection of any two codes $H_i$ and $H_j$, $i,j\in \{0,1,\dots ,n\}$ is constant, here $e_i$ is a binary vector in $F^n$ of weight $1$ with one in the $i$th coordinate position. For any $n=2^m-1$, $m>4$ we found a class of nonequivalent $2$-transitive uniform partitions of $F^n$ into cosets of Hamming codes.

7 pages