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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Int'l J. of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
