|
|||||
|
|
Intersections of q-ary perfect codes |
|
| Authors: | F I Solov’eva A V Los’ |
| Institution: | (1) Sobolev Institute of Mathematics, Novosibirsk, Russia |
| Abstract: | The intersections of q-ary perfect codes are under study. We prove that there exist two q-ary perfect codes C 1 and C 2 of length N = qn + 1 such that |C 1 ? C 2| = k · |P i |/p for each k ∈ {0,..., p · K ? 2, p · K}, where q = p r , p is prime, r ≥ 1, $n = \tfrac{{q^{m - 1} - 1}}{{q - 1}}$ , m ≥ 2, |P i | = p nr(q?2)+n , and K = p n(2r?1)?r(m?1). We show also that there exist two q-ary perfect codes of length N which are intersected by p nr(q?3)+n codewords. |
| Keywords: | q-ary perfect codes intersection of codes switching of components Hamming code |
| 本文献已被 SpringerLink 等数据库收录！ | |