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 linear equivalence and phelps codes
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2010 (English)In: Advances in Mathematics of Communications, ISSN 1930-5346, Vol. 4, no 1, 69-81 p.Article in journal (Refereed) Published
Abstract [en]

It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.

Place, publisher, year, edition, pages
2010. Vol. 4, no 1, 69-81 p.
Keyword [en]
Perfect codes, tilings, perfect codes, classification, construction, kernels
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-19270DOI: 10.3934/amc.2010.4.69ISI: 000275051900005Scopus ID: 2-s2.0-77949546309OAI: oai:DiVA.org:kth-19270DiVA: diva2:337317
Note
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2011-01-20Bibliographically 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.)
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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