Open AccessCyclic Codes from a Sequence over Finite Fields
Author(s) -
Nopendri Nopendri,
Intan Muchtadi-Alamsyah,
Djoko Suprijanto,
Aleams Barra
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i3.3907
Subject(s) - mathematics , finite field , trace (psycholinguistics) , fountain code , decoding methods , coding theory , sequence (biology) , coding (social sciences) , monomial , block code , discrete mathematics , code (set theory) , linear code , theoretical computer science , algorithm , computer science , programming language , philosophy , linguistics , statistics , set (abstract data type) , biology , genetics
A cyclic code has been one of the most active research topics in coding theory because they have many applications in data storage systems and communication systems. They have efficient encoding and decoding algorithms. This paper explains the construction of a family of cyclic codes from sequences generated by a trace of a monomial over finite fields of odd characteristics. The parameter and some examples of the codes are presented in this paper.