Change search
ReferencesLink to record
Permanent link

Direct link
A survey of perfect codes
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2008 (English)Article, review/survey (Refereed) Published
Abstract [en]

The first examples of perfect e-error correcting q-ary codes were given in the 1940's by Hamming and Golay. In 1973 Tietavainen, and independently Zinoviev and Leontiev, proved that if q is a power of a prime number then there are no unknown multiple error correcting perfect q-ary codes. The case of single error correcting perfect codes is quite different. The number of different such codes is very large and the classification, enumeration and description of all perfect 1-error correcting codes is still an open problem. This survey paper is devoted to the rather many recent results, that have appeared during the last ten years, on perfect 1-error correcting binary codes. The following topics are considered: Constructions, connections with tilings of groups and with Steiner Triple Systems, enumeration, classification by rank and kernel dimension and by linear equivalence, reconstructions, isometric properties and the automorphism group of perfect codes.

Place, publisher, year, edition, pages
2008. Vol. 2, no 2, 223-247 p.
Keyword [en]
perfect codes, error-correcting codes, steiner triple-systems, finite vector-spaces, full-rank tilings, 1-perfect codes, binary-codes, rook domains, partitions, construction, classification
URN: urn:nbn:se:kth:diva-17551ISI: 000256120100008ScopusID: 2-s2.0-69249159047OAI: diva2:335595
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text


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

Total: 109 hits
ReferencesLink to record
Permanent link

Direct link