Abstract:
A perfect binary code $C$ of length $n=2^k-1$ is called affine systematic if there exists a $k$-dimensional subspace of $\{0,1\}^n$ such that the intersection of $C$ and any coset with respect to this subspace is a singleton; otherwise $C$ is called affine nonsystematic. We describe the construction of affine nonsystematic codes. Bibliogr. 12.
Fulltext:
PDF file (284 kB)