Show simple item record

dc.contributor.authorFanuel, Olege.
dc.contributor.authorColleta, Okaka Akinyi.
dc.contributor.authorOduor, Owino Maurice.
dc.contributor.authorAywa, Shem.
dc.date.accessioned2019-05-06T18:30:27Z
dc.date.available2019-05-06T18:30:27Z
dc.date.issued2016
dc.identifier.urihttp://erepository.kibu.ac.ke/handle/123456789/866
dc.description.abstractThe 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. Keywords: Polynomial Ring, Ideals, Perfect codes, Error Control.en_US
dc.language.isoenen_US
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.subjectPolynomial ringen_US
dc.subjectIdealsen_US
dc.subjectPerfect codesen_US
dc.subjectError controlen_US
dc.titlePerfect repetition codes of ideals of the polynomial ring 2 [ ] ( 1) n n F x mod x − for error control in computer applicatonsen_US
dc.typeArticleen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 3.0 United States