Perfect Repetition Codes of Ideals of the Polynomial Ring 2 [ ] ( 1) n n F x mod x − for Error Control In Computer Applicatons

Abstract

The study of perfect codes has attracted a lot of interest among researchers in coding theory in view of the fact that many authors have indicated that this type of codes is rare. These codes are considered the best for theoretical and practical reasons. In this paper we demonstrate the determination of perfect codes from ideals of polynomial rings and characterize them for error control in computer applications. GAP software has been used to generate these codes and to confirm that they are indeed perfect. The Mathematical Structure of the generating polynomial ring has been fully discussed and the corresponding perfect codes have been characterized.