• Corpus ID: 2490449

On cyclic codes over the ring $Z_p + uZ_p + ... + u^{k-1}Z_p$

@article{Singh2012OnCC,
  title={On cyclic codes over the ring \$Z\_p + uZ\_p + ... + u^\{k-1\}Z\_p\$},
  author={Abhay Kumar Singh and Pramod Kumar Kewat},
  journal={ArXiv},
  year={2012},
  volume={abs/1205.4148}
}
In this paper, we study cyclic codes over the ring $ \Z_p + u\Z_p +...+ u^{k-1}\Z_p $, where $u^k =0$. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes. 
3 Citations

Tables from this paper

Cyclic codes over Z4[u]/ of odd length

The dual code of each cyclic code and self-dual cyclic codes over R of length n are investigated and a formula to count the number of codewords in each code is given.

References

SHOWING 1-10 OF 14 REFERENCES

Cyclic codes over the rings Z2 + uZ2 and Z2 + uZ2 + u2Z2

The rank, the dual, and the Hamming distance of these codes are studied as well as examples of cyclic codes of various lengths.

Cyclic Codes and Self-Dual Codes Over F2 + uF2

We introduce linear cyclic codes over the ring F/sub 2/+uF/sub 2/={0,1,u,u~=u+1}, where u/sup 2/=0 and study them by analogy with the Z/sub 4/ case. We give the structure of these codes on this new

On the generators of Z4 cyclic codes of length 2e

Each ideal has a unique distinguished set of generators that characterizes any cyclic code in the ring Z4[x]/(xn-1).

On the generators of Z4 cyclic codes of length 2e

Each ideal has a unique distinguished set of generators that characterizes any cyclic code and is associated with each ideal in the ring Z4[x]/(xn-1).

Self-Dual Codes over the Integers Modulo 4

Cyclic codes and quadratic residue codes over Z4

It is proved that any Z/ sub 4/-cyclic code C has generators of the form (fh, 2fg) where fgh=x/sup n/-1 over Z/sub 4/ and |C|=4/sup deg g/2/Sup deg h/.

Cyclic Codes Over Z4 of Oddly Even Length

Modular andp-adic cyclic codes

This paper presents some basic theorems giving the structure of cyclic codes of lengthn over the ring of integers modulopa and over thep-adic numbers, wherep is a prime not dividingn. An especially

A mass formula and rank of /spl Zopf//sub 4/ cyclic codes of length 2/sup e/

A closed-form expression is derived for the number of cyclic codes of length n for a given length n and the rank of these codes is studied and an expression for that is derived.

On Repeated-root Cyclic Codes

The relative minimum distance d/sub min//n of q-ary repeated-root cyclic codes of rate r>or=R is proven to tend to zero as the largest multiplicity of a root of the generator g(x) increases to infinity.