Characterization of codes of ideals of the polynomial ring for control in computer applicatons

dc.contributor.author	Olege, Fanuel
dc.contributor.author	Owino, M.O.
dc.contributor.author	Aywa, Shem
dc.contributor.author	Okaka, Colleta A.
dc.date.accessioned	2019-04-30T05:58:49Z
dc.date.available	2019-04-30T05:58:49Z
dc.date.issued	2016-06-01
dc.identifier.issn	2 3 4 7 1 9 2 1
dc.identifier.uri	http://erepository.kibu.ac.ke/handle/123456789/781
dc.description.abstract	The study of ideals in algebraic number system has contributed immensely in preserving the notion of unique factorization in rings of algebraic integers and in proving Fermat’s last Theorem. Recent research has revealed that ideals in Noetherian rings are closed in polynomial addition and multiplication.This property has been used to characterize the polynomial ring F_2^n[x] mod(xn-1) for error control. In this research we generate ideals of the polynomial ring using GAP software and characterize the polycodewords using Shannon’s Code region and Manin’s bound.	en_US
dc.language.iso	en	en_US
dc.publisher	C o u n c i l f o r I n n o v a t i v e R e s e a r c h : J o u r n a l o f A d v a n c e s i n M a t h e m a t i c s	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	Error detection	en_US
dc.subject	Error correction	en_US
dc.subject	Code region.	en_US
dc.title	Characterization of codes of ideals of the polynomial ring for control in computer applicatons	en_US
dc.type	Article	en_US

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