Perfect repetition codes of ideals of the polynomial ring 2 [ ] ( 1) n n F x mod x − for error control in computer applicatons

dc.contributor.author	Fanuel, Olege.
dc.contributor.author	Colleta, Okaka Akinyi.
dc.contributor.author	Oduor, Owino Maurice.
dc.contributor.author	Aywa, Shem.
dc.date.accessioned	2019-05-06T18:30:27Z
dc.date.available	2019-05-06T18:30:27Z
dc.date.issued	2016
dc.description.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. Keywords: Polynomial Ring, Ideals, Perfect codes, Error Control.	en_US
dc.identifier.uri	http://erepository.kibu.ac.ke/handle/123456789/866
dc.language.iso	en	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/	*
dc.subject	Polynomial ring	en_US
dc.subject	Ideals	en_US
dc.subject	Perfect codes	en_US
dc.subject	Error control	en_US
dc.title	Perfect repetition codes of ideals of the polynomial ring 2 [ ] ( 1) n n F x mod x − for error control in computer applicatons	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1