On Intersection Problem for Perfect Binary Codes |
| |
| Authors: | Sergey V. Avgustinovich Olof Heden Faina I. Solov’eva |
| |
| Affiliation: | (1) Sobolev institute of Mathematics, pr. Koptyuga 4, Novosibirsk, 630090, Russia;(2) Department of Mathematics, KTH, S-100 44 Stockholm, Sweden |
| |
| Abstract: | The main result is that to any even integer q in the interval 0 ≤ q ≤ 2n+1-2log(n+1), there are two perfect codes C1 and C2 of length n = 2m − 1, m ≥ 4, such that |C1 ∩ C2| = q. |
| |
| Keywords: | Perfect binary codes |
| 本文献已被 SpringerLink 等数据库收录！ |
|
