| | Standard Course Syllabus | Course Supervisor | Date of Approval |
| | Dept. of Electrical and Computer Engineering | Takeshita | February 17, 1999 |
| | 803 | Coding Theory |
| | 2. | CATALOG DESCRIPTION |
| | Error detection and correction codes for communications and data storage, finite fields and polynomial algebra, linear codes, |
| | Hamming and Reed-Mueller codes, cyclic codes, burst error correction codes, interleaving, Fire codes, and Reed-Solomon |
| | codes. |
| | Quarters of Offering | Credits | | Level | Class Meeting |
| | Wi Qtr (even years). | 3 | G | 3 cl. |
| | Course Prerequisites |
| | Prereq: 804. |
| | 3. | PREREQUISITES BY TOPIC |
| | Probability and random variables, linear algebra |
| | Courses that require this as a direct prerequisite |
| | none |
| | 4. | Text(s) and Other Course Materials | Author(s) | Publisher |
| | Error Control Systems for Digital Communication and | Wicker, Stephen B. | Prentice-Hall |
| | Storage, 1995 |
| | References (supplemental reading) |
| | [1] S. Lin and D. J Costello, Error Control Coding: Fundamentals and Applications, Prentice-Hall, 1983 |
| | [2] G. Clark and J. Cain, Error Correction Coding for Digital Communications, Plenum Press, 1981 |
| | [3] F. J. MacWilliams, N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, 1977 |
| | [4] W. W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd ed., MIT Press, 1972 |
| | [5] J. G. Proakis, Digital Communications, 2nd ed., McGraw-Hill, 1989 |
| | [6] S. W. Golomb, R. E. Peile, R.A. Scholtz, Basic Concepts in Information Theory and Coding, Plenum Press, 1994. |
| | [7] Wicker and Bhargava, Reed-Solomon Codes and their Applications, IEEE Press, 1994. |
| | 5. | COURSE OBJECTIVES |
| | 1. Students learn theoretical background for coding theory. (Criterion 3(a)) |
| | 2. Students learn algebraic and convolutional codes. (Criterion 3(a)) |
| | 3. Students learn to design and implement coders and decoders. (Criteria 3(c),(e),(k)) |
| | 6. | TOPICS AND (# OF LECTURES) |
| | Discrete memoryless channels, capacity, Shannon's theorem, binary vector spaces (4) |
| | Linear block codes (5) |
| | Cyclic codes (4) |
| | Galois field theory (4) |
| | BCH and Reed-Solomon codes (4) |
| | Convolutional codes (6) |
| | Viterbi decoding (3) |
| | 7. | CLASS MEETING PATTERN | (For example, "3cl." means 3 48-min classes per week.) |
| | 3 cl. |
| | Thursday, August 14, 2008 09:22 AM |
| | Page 1 of 2 |