Change search
ReferencesLink to record
Permanent link

Direct link
On perfect codes over non prime power alphabets
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2010 (English)In: ERROR-CORRECTING CODES, FINITE GEOMETRIES AND CRYPTOGRAPHY / [ed] Bruen AA; Wehlau DL, 2010, Vol. 523, 173-184 p.Conference paper (Refereed)
Abstract [en]

Known results on perfect codes over alphabets with q elements where q is not a prime power is surveyed. Some tools recently developed for the study of perfect 1-error correcting binary codes are generalized to the case of non prime power alphabets. A theorem by H. W. Lenstra from 1972 on the algebraic structure of perfect codes over non prime power alphabets will, by using this generalization, be further strengthened.

Place, publisher, year, edition, pages
2010. Vol. 523, 173-184 p.
, Contemporary Mathematics, ISSN 0271-4132 ; 523
Keyword [en]
Perfect codes, Fourier coefficients, Super dual
National Category
URN: urn:nbn:se:kth:diva-29200ISI: 000283176500016OAI: diva2:393650
Conference on Error-Control Codes, Information Theory and Applied Cryptography, Univ Toronto, Fields Inst, Toronto, CANADA, DEC 05-06, 2007
QC 20110131Available from: 2011-01-31 Created: 2011-01-27 Last updated: 2011-01-31Bibliographically 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: 45 hits
ReferencesLink to record
Permanent link

Direct link