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
On the reconstruction of perfect codes
KTH, Superseded Departments, Mathematics.
2002 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 256, no 2-Jan, 479-485 p.Article in journal (Refereed) Published
Abstract [en]

We show how to reconstruct a perfect I-error correcting binary code of length n from the code words of weight (n + 1)/2.

Place, publisher, year, edition, pages
2002. Vol. 256, no 2-Jan, 479-485 p.
Identifiers
URN: urn:nbn:se:kth:diva-22037ISI: 000179151400038OAI: oai:DiVA.org:kth-22037DiVA: diva2:340735
Note
QC 20100525Available from: 2010-08-10 Created: 2010-08-10 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Heden, Olof
By organisation
Mathematics
In the same journal
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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