H. Q. Dinh, “Negacyclic Codes of Length 2s over Galois Rings,” IEEE Transactions on Information Theory, Vol. 51, No. 12, 2005, pp. 4252-4262. doi:10.1109/TIT.2005.859284

has been cited by the following article:

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

  AUTHORS: Dajian Liao, Yuansheng Tang

  KEYWORDS: Frobenius Ring; Constacyclic Codes; Generator Polynomial; Dual Codes

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.4, April 19, 2012

  ABSTRACT: 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.