Change search
ReferencesLink to record
Permanent link

Direct link
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
URN: urn:nbn:se:kth:diva-19270DOI: 10.3934/amc.2010.4.69ISI: 000275051900005ScopusID: 2-s2.0-77949546309OAI: diva2:337317
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.)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 39 hits
ReferencesLink to record
Permanent link

Direct link