Cyclic code
Encyclopedia : C : CY : CYC : Cyclic code
In mathematics of coding theory and digital communications, cyclic codes find an important application in error detection and correction.
Definition
Let C be a linear code over a finite field A of block length n. C is called a cyclic code, if for every codeword c=(c1,...,cn) from C, the word (cn,c1,...,cn-1) in An obtained by a cyclic right shift of components is also a codeword from C.Sometimes, C is called the c-cyclic code, if C is the smallest cyclic code containing c, or, in other words, C is the linear code generated by c and all codewords obtained by cyclic shifts of its components.
For example, if A=[\mathbb_2] and n=3, the codewords contained in the (1,1,0)-cyclic code are precisely
- [(0,0,0), (1,1,0), (0,1,1)] and [(1,0,1)].
See also
This article incorporates material from on PlanetMath, which is licensed under the [Text of the GNU Free Documentation LicenseGFDL].
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
