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

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    1 2  n n F x mod x 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.