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.
Original language | English |
---|---|
Pages (from-to) | 71-80 |
Number of pages | 10 |
Journal | International Journal of Pure and Applied Mathematics |
Volume | 94 |
Issue number | 1 |
DOIs | |
State | Published - 2014 |
Keywords
- Cyclic codes
- Division algorithm
- Generators
- Principal ideals