Characterization of codes of ideals of the polynomial ring f30 2 [x] mod ô€€€ x30 ô€€€ 1 for error control in computer applicatons

dc.contributor.author	Olege, Fanuel.
dc.contributor.author	Oduor, Oduor M.
dc.contributor.author	Aywa, Shem.
dc.contributor.author	Okaka, Colleta A.
dc.date.accessioned	2019-05-06T16:40:19Z
dc.date.available	2019-05-06T16:40:19Z
dc.date.issued	2016-06-30
dc.identifier.uri	https://doi.org/10.24297/jam.v12i5.260
dc.identifier.uri	http://erepository.kibu.ac.ke/handle/123456789/862
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 Noethe-rian rings are closed in polynomial addition and multiplication.This property has been used to characterize the polynomial ring Fn 2 [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.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 f30 2 [x] mod ô€€€ x30 ô€€€ 1 for error 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