Abstract

Let B be any nite commutative ring with identity. In this case, B(X; 1 p kZ0) B(X; 1 p 2Z0) B(X; 1 p Z0), where p is a prime number and k 1, is the descending chain of commutative semigroup rings. All these semigroup rings are containing the polynomial ring B(X;Z0). In this paper, we introduced a construction technique of cyclic codes through the semi- group ring B(X; 1 p kZ0) instead of a polynomial ring.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call