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
A full rank perfect code of length 31
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2006 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 38, no 1, 125-129 p.Article in journal (Refereed) Published
Abstract [en]

A full rank perfect 1-error correcting binary code of length 31 with a kernel of dimension 21 is described. This was the last open case of the rank-kernel problem of Etzion and Vardy.

Place, publisher, year, edition, pages
2006. Vol. 38, no 1, 125-129 p.
Keyword [en]
perfect codes
Identifiers
URN: urn:nbn:se:kth:diva-15362DOI: 10.1007/s10623-005-5665-1ISI: 000234209600009Scopus ID: 2-s2.0-29344440007OAI: oai:DiVA.org:kth-15362DiVA: diva2:333403
Note
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-12-12Bibliographically 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.)
In the same journal
Designs, Codes and Cryptography

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 23 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