Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Intersections of perfect binary codes
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
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, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
Intersection number, Large class, Perfect codes, Upper Bound, Electronics engineering, Binary codes
National Category
Mathematics Other Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-149581DOI: 10.1109/SIBIRCON.2010.5555312Scopus ID: 2-s2.0-77957279745ISBN: 978-142447626-8 (print)OAI: oai:DiVA.org:kth-149581DiVA: diva2:740697
Conference
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
Note

QC 20140826

Available from: 2014-08-26 Created: 2014-08-25 Last updated: 2014-08-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Heden, Olof
By organisation
Mathematics (Div.)
MathematicsOther Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 19 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf