Unformatted text preview: n + 1. Now consider the cyclic code of length n which is generated by g(X). Show that this code has minimum weight at least 3. 4.4 Show that X + 1 is a factor of X n + 1. 4.5 Consider an (n,k) cycle code whose generator polynomial is g(X). Suppose that X + 1 is not a factor of g(X). Show that the vector of all 1's is a code vector....
View
Full Document
 Spring '09
 profnaganagi
 Coding theory, Hamming Code, parity check matrix, generator polynomial, Dr. N. El Naga

Click to edit the document details