Share This Article:

A Class of Constacyclic Codes over R + vR and Its Gray Image

Full-Text HTML XML Download Download as PDF (Size:222KB) PP. 222-227
DOI: 10.4236/ijcns.2012.54029    4,371 Downloads   7,551 Views Citations


We study (1 + 2v)-constacyclic codes overR + vR and their Gray images, where v2 + v = 0 and R is a finite chain ring with maximal ideal <λ> and nilpotency index e. It is proved that the Gray map images of a (1 + 2v)-constacyclic codes of length n over R + vR are distance-invariant linear cyclic codes of length 2n over R. The generator polynomials of this kind of codes for length n are determined, where n is relatively prime to p, p is the character of the field R/<λ> . Their dual codes are also discussed.

Cite this paper

D. Liao and Y. Tang, "A Class of Constacyclic Codes over R + vR and Its Gray Image," International Journal of Communications, Network and System Sciences, Vol. 5 No. 4, 2012, pp. 222-227. doi: 10.4236/ijcns.2012.54029.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.