Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
25 views

Lecture 12

Cyclic codes are a special type of linear block code where every cyclic shift of a codeword is also a codeword. Cyclic codes have elegant algebraic descriptions using polynomials and generator polynomials. They also allow for simple encoding and decoding using shift registers. Nearly all commonly used block codes are cyclic codes or shortened cyclic codes due to their advantages in encoding, decoding, and correcting burst and random errors.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

Lecture 12

Cyclic codes are a special type of linear block code where every cyclic shift of a codeword is also a codeword. Cyclic codes have elegant algebraic descriptions using polynomials and generator polynomials. They also allow for simple encoding and decoding using shift registers. Nearly all commonly used block codes are cyclic codes or shortened cyclic codes due to their advantages in encoding, decoding, and correcting burst and random errors.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Lecture 12

Cyclic Codes

Cyclic codes
A linear block code is cyclic if every cyclic shift of a codeword is a codeword. Cyclic codes have many advantages: Elegant algebraic descriptions: c(x) = m(x)g(x), where g(x) is generator polynomial c(x)h(x) = 0 mod (xn-1) c(1 ) = 0; : : : ; c(t ) = 0, where i GF(qm ) Shift register encoders and syndrome units

Cyclic codes

Simple burst correction Random error correction by solving polynomial equations Cyclic codes are (by definition) very special case of linear codes.

But nearly all commonly used block codes are (shortened) cyclic codes.

Cyclic codes

Definition: The right cyclic shift of v0v1..vn-1 is vn-1 v0 v1.. Vn-2 The right cyclic shift of v is denoted by v(1) . When n-tuples are polynomials of degree n-1, the right cyclic shift of v(x), is also a polynomial of degree n-1. The right cyclic shift of v(x) by i positions is denoted v(i ) (x).

Cyclic Shifts of n-tuples and polynomials

Cond

Polynomial description of cyclic codes

The code polynomial v(i)(x) is simply the remainder resulting from dividing the polynomial xi v(x) by xn+1

Definition and basic properties

Generator Polynomial

Proof: 3

Non-systematic generator matrix

Theorems:
I. Let g(x)= 1+g1x+.+gr-1xr-1+xr be the non-zero code polynomial of minimum degree in an (n, k) cyclic code C. A binary polynomial of degree n-1 or less is a code polynomial iff it is a multiple of g(x). II. The nonzero code polynomial of minimum degree in a cyclic code C is unique

Cond
III.

In an (n, k) cyclic code, there exists one and only one code polynomial of degree n - k. The generator polynomial g(x) of an (n, k) cyclic code is a factor of x n+1 If g(x) is a polynomial of degree n k and is a factor of x n+1, then g(x) generates a cyclic code of order (n, k)

III.

IV.

You might also like