PERFECT CODES OVER HURWITZ INTEGERS INDUCED BY CIRCULANT GRAPHS

Abstract

In this paper, a new family of t−error correcting perfect codes over Hurwitz integers is presented. To obtain these perfect codes, the perfect t−dominating sets over the circulant graphs are used. The codewords of such perfect codes are generated by the elements of a subgroup of the considered group.