Click here for important class announcements.

[Instructors | Announcements | Lectures | Homework | Course Outline | References |

---

Instructors

Navin Kashyap
Office: SP 2.17

Lectures

Mondays & Wednesdays, 11:30am to 1pm
Location: ECE 1.08

Homework Assignments

Homework assignments consist primarily of exercises given during lectures. These may sometimes be supplemented with additional problems that will be made available through this website.

Exams

There will be no midterm exams. Status of final exam is yet to be determined. Watch this space.

Grading

The course grade will be based on the following: 10% for class attendance, 40% weightage assigned to the assignments, and 50% for either a final presentation or a final exam (to be determined).

Course Outline

The course intends to cover the following topics: finite-state channels, channels with synchronization errors (in particular, the insertion/deletion channel), input-constrained channels and associated constrained coding techniques.

References

• R.G. Gallager, Information Theory and Reliable Communication, John Wiley & Sons, 1968. (Basic material on finite-state channels are covered in Chapters 4 and 5 of this text.)
• B.H. Marcus, R.M. Roth, and P.H. Siegel, An Introduction to Coding for Constrained Systems, unpublished manuscript, available as lecture notes from Prof. Roth's website. (This is an excellent text covering input-constrained channels and constrained coding.)

A lot of the material covered in class will be drawn from papers from the literature:

• M. Mushkin and I. Bar-David, "Capacity and Coding for the Gilbert-Elliott Channels," IEEE Transactions on Information Theory, vol. 35, no. 6, pp. 1277-1290, Nov. 1989.
• A.J. Goldsmith and P.P. Varaiya, "Capacity, Mutual Information, and Coding for Finite-State Channels", IEEE Transactions on Information Theory, vol. 42, no. 3, pp. 868-886, May 1996.
• D.M. Arnold, H-A. Loeliger, P.O. Vontobel, A. Kavcic, and W. Zeng, "Simulation-Based Computation of Information Rates for Channels with Memory", IEEE Transactions on Information Theory, vol. 52, no. 8, pp. 3498-3508, Aug. 2006.
• P.O. Vontobel, A. Kavcic, D.M. Arnold, and H-A. Loeliger, "A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels", IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 1887-1918, May 2008.
• R.L. Dobrushin, "Shannon's Theorems for Channels with Sychronization Errors", Problemy Peredachi Informatsii, vol. 3, no. 4, pp. 18-36, 1967.
• N.J.A Sloane, "On Single-Deletion-Correcting Codes" [link].
• M.C. Davey and D.J.C MacKay, "Reliable Communication over Channels with Insertions, Deletions, and Substitutions", IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 687-698, Feb. 2001.
• M. Mitzenmacher, "A Survey of Results for Deletion Channels and Related Synchronization Channels", Probability Surveys, vol. 6, pp. 1-33, 2009.

---

[Instructors | Announcements | Lectures | Homework | Course Outline | References |

---