Change search
ReferencesLink to record
Permanent link

Direct link
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2011 (English)In: ADVANCES IN MATHEMATICS OF COMMUNICATIONS, ISSN 1930-5346, Vol. 5, no 2, 149-156 p.Article in journal (Refereed) Published
Abstract [en]

The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is generalized to the q-ary case. Simply speaking, every non-full-rank perfect code C is the union of a well-defined family of (mu) over bar -components K((mu) over bar), where (mu) over bar belongs to an "outer" perfect code C(star), and these components are at distance three from each other. Components from distinct codes can thus freely be combined to obtain new perfect codes. The Phelps general product construction of perfect binary code from 1984 is generalized to obtain (mu) over bar -components, and new lower bounds on the number of perfect 1-error-correcting q-ary codes are presented.

Place, publisher, year, edition, pages
2011. Vol. 5, no 2, 149-156 p.
Keyword [en]
Perfect codes, q-ary codes, components, lower bound
National Category
URN: urn:nbn:se:kth:diva-38865DOI: 10.3934/amc.2011.5.149ISI: 000293562800002ScopusID: 2-s2.0-79955752862OAI: diva2:438244
QC 20110901Available from: 2011-09-01 Created: 2011-09-01 Last updated: 2011-09-01Bibliographically 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: 14 hits
ReferencesLink to record
Permanent link

Direct link