On the generators of cyclic codes over Zmof any length n
Document Type
Article
Publication Date
1-1-2014
Abstract
Over the last two decades, there have been discoveries of various good codes over the rings Zmof integers modulo m. Restrictions have been imposed on the code's alphabet size m and over the code's length n for many reasons. This paper shows a construction of the generators of cyclic codes over Zmvia the Division Algorithm, with no restrictions on the aforementioned code parameters.
Publication Title
International Journal of Pure and Applied Mathematics
First Page Number
71
Last Page Number
80
DOI
10.12732/ijpam.v94i1.8
Recommended Citation
Beaugris, Louis, "On the generators of cyclic codes over Zmof any length n" (2014). Kean Publications. 2018.
https://digitalcommons.kean.edu/keanpublications/2018
COinS