On the generators of cyclic codes over Zmof any length n

Louis Beaugris

doi:10.12732/ijpam.v94i1.8

On the generators of cyclic codes over Z_mof any length n

Louis Beaugris

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Over the last two decades, there have been discoveries of various good codes over the rings Z_mof 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 Z_mvia 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	https://doi.org/10.12732/ijpam.v94i1.8
State	Published - 2014

Keywords

Cyclic codes
Division algorithm
Generators
Principal ideals

Access to Document

10.12732/ijpam.v94i1.8

Cite this

@article{decf41d1edd742b9ae7fd1be49044265,

title = "On the generators of cyclic codes over Zmof any length n",

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.",

keywords = "Cyclic codes, Division algorithm, Generators, Principal ideals",

author = "Louis Beaugris",

note = "Publisher Copyright: {\textcopyright} 2014 Academic Publications, Ltd.",

year = "2014",

doi = "10.12732/ijpam.v94i1.8",

language = "English",

volume = "94",

pages = "71--80",

journal = "International Journal of Pure and Applied Mathematics",

issn = "1311-8080",

publisher = "Academic Publications Ltd.",

number = "1",

}

TY - JOUR

T1 - On the generators of cyclic codes over Zmof any length n

AU - Beaugris, Louis

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Cyclic codes

KW - Division algorithm

KW - Generators

KW - Principal ideals

UR - https://www.scopus.com/pages/publications/84903641277

U2 - 10.12732/ijpam.v94i1.8

DO - 10.12732/ijpam.v94i1.8

M3 - Article

AN - SCOPUS:84903641277

SN - 1311-8080

VL - 94

SP - 71

EP - 80

JO - International Journal of Pure and Applied Mathematics

JF - International Journal of Pure and Applied Mathematics

IS - 1

ER -

On the generators of cyclic codes over Z_mof any length n

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this