EC Syllabus for NIT Jalandhar
EC-352 Information Theory and Coding [3 0 0 3]
Information Theory: Definition of Information, Entropy, Mutual Information, Properties of Mutual
Information, Fundamental Inequality, I.T. Inequality, Divergence, Properties of Divergence, Divergence Inequality, Relationship between entropy and mutual information, Chain Rules for entropy, relative entropy and mutual information.
Channel Capacity: Uniform Dispersive Channel, Uniform Focusing Channel, Strongly Symmetric Channel, Binary Symmetric Channel, Binary Erasure Channel. Channel Capacity of the all these channels, Channel Coding Theorem, Shannon-Hartley Theorem
Data Compression: Kraft inequality, Huffman codes, Shannon-Fano coding, Arithmetic Coding
Linear Block Codes
Systematic linear codes and optimum decoding for the binary symmetric channel;Generator and Parity Check matrices, Syndrome decoding on symmetric channels;Hamming codes; Weight enumerators and the MacWilliams identities; Perfect codes. Cyclic Codes,BCH codes; Reed-Solomon codes, Justeen codes, MDS codes, Alterant, Goppa and generalized BCH codes; Spectral properties of cyclic codes
Decoding of BCH codes: Berlekamp’s decoding algorithm, Massey’s minimum shift register synthesis technique and its relation to Berlekamp’s algorithm. A fast Berlekamp – Massey algorithm. Convolution codes Wozencraft’s sequential decoding algorithm, Fann’s algorithm and other sequential decoding algorithms; Viterbi decoding algorithm, Turbo Codes, Concatenated Codes.
1. F.J. MacWilliams and N.J.A. Slone, The theory of error correcting codes,North Holland, 1977.
2. R.E. Balahut, Theory and practice of error control codes, Addison Wesley, 1983.
3. Thomas M. Cover, Joy A. Thomas, “Elements of Information Theory”, Wiley Publishers.
4. Ranjan Bose,” Information Theory Coding, Cryptography”, TMH Publication.