Scribd
Upload
78 views2 pages

Error Control Coding: Midterm

The document is a midterm exam for an error control coding course. It consists of 6 problems testing knowledge of topics like irreducible polynomials over Galois fields, power representation in Galois fields, cyclic code generation and properties, Meggitt decoder design, the triangle inequality for Hamming distance, and properties of field elements. The exam is 120 minutes long and allows 15 formulas, with detailed derivations and explanations required for full points. It is out of 100 points total and wishes students good luck.

Uploaded by

Dheeraj Gaddi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
78 views2 pages

Error Control Coding: Midterm

The document is a midterm exam for an error control coding course. It consists of 6 problems testing knowledge of topics like irreducible polynomials over Galois fields, power representation in Galois fields, cyclic code generation and properties, Meggitt decoder design, the triangle inequality for Hamming distance, and properties of field elements. The exam is 120 minutes long and allows 15 formulas, with detailed derivations and explanations required for full points. It is out of 100 points total and wishes students good luck.

Uploaded by

Dheeraj Gaddi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Error Control Coding

Thursday, May 8, 2003

Midterm

1.
2.
3.
4.
5.

120 minutes.
15 formula are allowed.
Answers without detail derivations or explanations earn no points.
100 points in total.
Good luck.

Problem 1. [30]
(a) [5] What is the definition of a polynomial p(X) over GF(2) of degree m to be
irreducible over GF(2)? Is X4+X3+X2+X+1 irreducible over GF(2)?
(b) [5] What is the definition of a polynomial p(X) over GF(2) of degree m to be primitive?
Is X4+X3+X2+X+1 a primitive polynomial over GF(2)?
(c) [3] What is the definition of a polynomial to be the minimal polynomial of in
GF(2m)?
(d) [6] Given that the polynomial p(X)=X4+X+1 is a primitive polynomial over GF(2) and
is an element of GF(24). Construct a table to show all the elements of GF(24) using power
representation, polynomial representation, and 4-Tuple representation.
(e) [6] From (d), find the minimal polynomial of 8, 10, and 12.
(f) [5]
If a cyclic code of block length n=2m-1 with dmin2t+1 is generated by the
polynomial g(X)=LCM{1,3,5=2t-1}, where1,3,5 are the minimal polynomials of ,
3, and 5 in (d), prove that the minimum distance is exactly 7.
Problem 2. [15]
p
Given the fact that: p for all k 1, 2,3,..., p 1 and for all prime integers p.
k
Let 1, 2, 3, , t, be elements in the field GF(pm). Prove that

1 2 ... t
Hint:

pr

1p 2p ... tp for r 1, 2,3,...

1. Prove the case t=2 and the rest follows by induction.


2. GF(pm) has characteristic p.

Problem 3. [10]

Prove Theorem 3.2.


Problem 4. [15] Meggitt Decoder
Given a generic Meggitt decoder as shown in the following figure:

(a) [5] Describe the operation of the Meggitt decoder.


(b) [10] Design a Meggitt decoder for a (7,4) cyclic code generated by g(X)=1+X+X3. In
particular, show the detail feedback connection of the syndrome register, and the error
pattern detection circuit.
Problem 5. [10]
Prove that the Hamming distance satisfies the triangle inequality; that is, let x, y, and z be
three n-tuples over GF(2), and show that
d x, y d y , z d x , z
Problem 6. [20]
(a) [5] Consider the (15,11) cyclic Hamming code generated by g(X)=1+X+X4. Determine
the parity polynomial h(X) of this code.
(b) [5] Show that g(X)= 1+X2+X4+X6+X7+X10 generates a (21,11) cyclic code.
(c) [5] Show that, for every element a in a field, a0=0a=0.
(d) [5] Show that, for a0, ab=ac implies that b=c.

You might also like