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.
Grading
The course grade will be based on the following: 10% for class
attendance, 40% weightage assigned to the assignments, and 50% for
a project presentation.
Pre-requisite
A first course in information theory (E2 201 or equivalent)
Basic definitions, motivation and applications; Gilbert-Elliott channel; intersymbol interference channels; unifilar channels; memoryless channels with input constraints
Information-theoretic capacity and channel coding theorems; computable bounds on channel capacity
Feedback capacity and its dynamic programming formulation; posterior matching schemes for achieving feedback capacity
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.)
A lot of the material covered in class will be drawn from papers
from the literature:
H.H. Permuter, P. Cuff, B. Van Roy and T. Weissman,
"Capacity of the trapdoor channel with feedback",
IEEE Transactions on Information Theory, vol. 54, no. 7, pp. 3150-3165, Jul. 2009.