On the generators of cyclic codes over Zmof any length n

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)71-80
Number of pages10
JournalInternational Journal of Pure and Applied Mathematics
Volume94
Issue number1
DOIs
StatePublished - 2014

Keywords

  • Cyclic codes
  • Division algorithm
  • Generators
  • Principal ideals

Fingerprint

Dive into the research topics of 'On the generators of cyclic codes over Zmof any length n'. Together they form a unique fingerprint.

Cite this