Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes

Details Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes

2009-06-22

arxiv.org/abs/0906.4008v1

Computer Science

Information Theory

We do not plan to publish the results of this paper on their own. We have put this paper for referring purposes

Scientific paper

We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\ respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible over the alphabet $\F_{p^a}$. We generalize the results of [5], [6] and [7] by computing the minimum Hamming distance of these codes. As a particular case, we determine the minimum Hamming distance of cyclic and negacyclic codes, of length $2p^s$, over a finite field of characteristic $p$.

Affiliated with

Also associated with

No associations

Rating

Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes 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 Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495651