U

IV

ERSITAT

University of Ulm Dept. of Telecommunications and Applied Information Theory Ralph Jordan Georg Schmidt

ANDO

UR

Exercise 9

IN

FO

RMATI

Problem 9.1
Calculate the generator polynomial g(x) of a single-error correcting BCH code with length 31. Use p(x) = x5 + x2 + 1 as a primitive polynomial over GF (2).

Problem 9.2
Determine the dimension ki of the i-error correcting BCH code with length n = 31 for i = 1, 2, 3, 5, 7.

Problem 9.3
Consider the Galois eld GF (7), with the primitive element = 5: a) Determine the generator polynomial g(x) of a RS code C of length n = 6 that can correct one error. Choose the highest-degree coecients in the transformation domain as zero. b) Determine the parity check polynomial h(x) such that h(x)g(x) = xn 1. c) Is the polynomial c(x) = 6 + 4x + 6x2 + x3 a codeword of C?

Problem 9.4
Consider the Galois eld GF (7), with the primitive element = 5 and the generator polynomial g(x) = x2 + 5x + 6 of an RS code C of length n = 6. a) Determine the parameters k, d and the rate R of the code. b) Determine the by one coordinate extended codeword, when the information polynomial is i(x) = x+1 and the codeword results from the multiplication by the generator polynomial a(x) = i(x)g(x).

Problem 9.5
Consider the RS code C of length n = 6 over the Galois eld GF (7). The primitive element is = 5. The code can correct two errors. You are given the DF T A = (2, 5, 0, 0, 0, 0). The received word is r = (0, 6, 3, 4, 1, 3). Carry out the decoding and determine the transmitted codeword c C. Solve the problem using the key equation procedure.

Channel Coding

HE

ORY

Problems for Channel Coding Summer Term 2003

T EL

OM

MUNIC

AT

LM
SCIEN
D

NS

APPL

IE

O
DO

CENDO