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.
Similar content being viewed by others
References
Avgustinovich SV, Heden O, Solov’eva FI (2005). On intersections of perfect binary codes. to appear in the Proceedings of ALCOMA 05
SV Avgustinovich A Lobstein FI Solov’eva (2001) ArticleTitleIntersection matrices for partitions by binary perfect codes IEEE Trans Inform Theory 47 IssueID4 1621–1624 Occurrence Handle10.1109/18.923749 Occurrence Handle1830113
T Etzion A Vardy (1998) ArticleTitleOn perfect codes and tilings, problems and solutions SIAM J Discrete Math 11 IssueID2 205–223 Occurrence Handle10.1137/S0895480196309171 Occurrence Handle99f:94017
MacWilliams FJ, Sloane NJA (1977). The theory of error-correcting codes, Amsterdam North-Holland
GS Shapiro DS Slotnik (1959) ArticleTitleOn the mathematical theory of error correcting codes IBM J Res Develop 3 68–72
Solov’eva FI (2004). On perfect codes and related topics, Com2Mac Lecture Note Series 13, Pohang 2004
YL Vasil’ev (1962) ArticleTitleOn nongroup close-packed codes Problems Cybernet 8 375–378
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Zinoviev
Rights and permissions
About this article
Cite this article
Avgustinovich, S.V., Heden, O. & Solov’eva, F.I. On Intersection Problem for Perfect Binary Codes. Des Codes Crypt 39, 317–322 (2006). https://doi.org/10.1007/s10623-005-4982-8
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-4982-8