On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings

Details On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings

2009-03-16

arxiv.org/abs/0903.2791v1

Computer Science

Information Theory

Submitted

Scientific paper

Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length $p^s$, where $p$ is the characteristic of the alphabet ring, have been studied under some additional hypotheses. In each one of those cases, the ambient space for the codes has turned out to be a chain ring. In this paper, all remaining cases of cyclic and negacyclic codes of length $p^s$ over a Galois ring alphabet are considered. In these cases the ambient space is a local ring with simple socle but not a chain ring. Nonetheless, by reducing the problem to one dealing with uniserial subambients, a method for computing the Hamming distance of these codes is provided.

Affiliated with

Also associated with

No associations

Rating

On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over Galois Rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224139