Unformatted text preview: u = [ x ]. Note: the polynomial g ( x ) is in GF(16)[ x ], not necessarily Z 2 [ x ]. Additional problems: 1. Construct a [15 , k ] BCH code over Z 2 with designed distance 5 for which k is as large as possible. What is the minimum distance of the code? 2. Construct a [15 , k ] BCH code over Z 2 with designed distance 7 for which k is as large as possible. What is the minimum distance of the code? 3. Construct a BCH code of length 8 over Z 3 with designed distance 5....
View
Full Document
 Spring '11
 NA
 Coding theory, Polynomial code, Minimum distance, ReedSolomon code, BCH code

Click to edit the document details