This preview shows pages 1–24. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Cyclic code of GF(q): represent as polynomials over GF(q) of degree less than n. c(X) Cyclic shift: Xc(X) mod X n1 The lowest monic polynomial, g(X) Denote its degree by m. g(X), Xg(X), , X nm1 g(X) are all codewords Viewing as a vector space, they are linearly independent Any codeword c(X)=a(X)g(X)+r(X) , r(X)=0. Thus, called generator polynomial. g(X) divides X n1...
View
Full
Document
 Spring '08
 DanielLee

Click to edit the document details