Affine nonsystematic codes |
| |
| Authors: | S A Malyugin |
| |
| Institution: | 1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia
2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia
|
| |
| 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 each coset with respect to this subspace is a singleton; otherwise C is called affine nonsystematic. In this article we construct affine nonsystematic codes. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
