On perfect 1-$\mathcal E$-error-correcting codes

Olof Heden; Murat Güzeltepe

Vol. 20 No. 1 (2015)

Regular Articles

On perfect 1-$\mathcal E$-error-correcting codes

Published 2014-11-22

Olof Heden
Murat Güzeltepe

Olof Heden
Department of Mathematics KTH Stockholm Sweden

Murat Güzeltepe
Department of Mathematics Sakarya Universit TR54187 Sakarya Turkey

Submission of an original manuscript to the Mathematical Communications will be taken to mean that it represents original work not previously published, that it is not being considered elsewhere for publication; and, if accepted for publication, it will be published in print and online form and it will not be published elsewhere in the same form, for commercial purposes, in any language, without the consent of the publisher. The journal takes the stance that the publication of scholarly research is meant to disseminate knowledge and, in a not-for-profit regime, benefits neither publisher nor author financially. It sees itself as having an obligation to its authors and to society to make content available online now that the technology allows for such a possibility.

Abstract

We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this new class of perfect codes that are called perfect 1-$\mathcal{E}$-error-correcting codes. We also show that in some cases such codes contain quite a few perfect 1-error-correcting $q$-ary Hamming codes as subsets.

Keywords

Perfect codes

PDF

Supplementary File(s)

LaTeX file