ON LINEAR EQUIVALENCE AND PHELPS CODES
2010 (English)In: ADVANCES IN MATHEMATICS OF COMMUNICATIONS, ISSN 1930-5346, Vol. 4, no 1, 69-81 p.Article in journal (Refereed) Published
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.
Perfect codes, tilings
IdentifiersURN: urn:nbn:se:liu:diva-54410DOI: 10.3934/amc.2010.4.69ISI: 000275051900005OAI: oai:DiVA.org:liu-54410DiVA: diva2:303511