Abstract
Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp + uFp + u2Fp and codes over Fp is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear (1+u+u2)-constacyclic code over Fp + uFp + u2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from (1 + u + u2)-constacyclic codes over F3 + uF3 + u2F3 are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
