Math 480, Fall 2016, Assignment 9

Mathematical proofs, like diamonds, are hard as well as clear, and will be touched with nothing but strict reasoning.

- John Locke, Second Reply to the Bishop of Worcester

Carefully define the following terms, then give one example and one non-example of each:

1. Maximum likelihood decoding.
2. MLD table.
3. Hamming distance.
4. Nearest code word decoding.
5. Reliability (of a code-and-channel system; see section 4.5 for the definition).

Solve the following problems:

1. Section 4.5, problems 1 and 2.

--------------------End of assignment--------------------