Abstract
Let R be a Galois ring, GR(pn,r), of characteristic pn and of order pnr. In this article, we study cyclic codes of arbitrary length, N, over R. We use discrete Fourier transform (DFT) to determine a unique representation of cyclic codes of length, N, in terms of that of length, ps, where s=vp(N) and vp are the p-adic valuation. As a result, Hamming distance and dual codes are obtained. In addition, we compute the exact number of distinct cyclic codes over R when n=2.
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
