Intersections of perfect binary codes
2010 (English)In: Proceedings - 2010 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON-2010, 2010, 52-54 p.Conference paper (Refereed)
Intersections of perfect binary codes are investigated. In 1998 Etzion and Vardy proved that the intersection number η(C;D), for any two distinct perfect codes C and D, is always in the range 0 ≤η(C;D) ≤2 n-log(n+1)-2(n-1)/2; where the upper bound is attainable. We improve the upper bound and show that the intersection number 2n-log(n+1) -2(n-1)/2 is "sporadic". We also find a large class of intersection numbers for perfect binary codes of length 15 and for any admissible n >15 a new set of intersection numbers for perfect codes of length n.
Place, publisher, year, edition, pages
2010. 52-54 p.
Intersection number, Large class, Perfect codes, Upper Bound, Electronics engineering, Binary codes
Mathematics Other Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-149581DOI: 10.1109/SIBIRCON.2010.5555312ScopusID: 2-s2.0-77957279745ISBN: 978-142447626-8OAI: oai:DiVA.org:kth-149581DiVA: diva2:740697
2010 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON-2010, 11 July 2010 through 15 July 2010, Irkutsk Listvyanka, Russian Federation
QC 201408262014-08-262014-08-252014-08-26Bibliographically approved