This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||
|
Not cryptography
editThis article is not cryptoraphy related, it is about coding schemes for robust telecommunications.
I have a degree in Management Information Systems. I am trying to learn what a cyclic code is. This article has left an emotional impression, but I have not learned what I came here seeking. I am leaving to go elsewhere on the Internet to learn what a cyclic code is.
james.carnell@yahoo.com
Irreducible code
editIn the section "Algebraic structure", Wikipeida said:
An irreducible code is a cyclic code in which the code, as an ideal, is minimal in R, so that its generator is an irreducible polynomial.
But irreducible polynomial generate maximal ideal.
From J.H.van Lint's book "Introduction to Coding Theory" page 83, (6.1.6):
The cyclic code generated by is called a maximal cyclic code(since it is a maximal ideal) and denote by . The code generated by is called a minimal cyclic code and denoted by . Minimal cyclic codes are also called irreducible cyclic codes.