Problem 5.y 1. Show that if g(X) generates a cyclic code of odd minimum distance d, then X 1)g(X) generates a cyclic code of minimum distance at least d+1. enerates a cyclic Hamming code of len 7. Find its dimension and minimum distance 3. Find the dimension and minimum distance of the code of length 7 generated by the polynomial (X1)g(X) where g(X)-1+X +X Problem 5.y 1. Show that if g(X) generates a cyclic code of odd minimum distance d, then X 1)g(X) generates a cyclic code of minimum distance at least d+1. enerates a cyclic Hamming code of len 7. Find its dimension and minimum distance 3. Find the dimension and minimum distance of the code of length 7 generated by the polynomial (X1)g(X) where g(X)-1+X +X