INFORMATION CODING THEORY CSE Syllabus for NIT Jalandhar

INFORMATION CODING THEORY CSE Syllabus for NIT Jalandhar

 CS-203 INFORMATION CODING THEORY [3 0 0 3]

Information, channel capacity, the concept of amount of information, entropy, Information rate, Conditional and joint entropies.
Source coding : Noise less coding, Shannon’s first fundamental theorem, Discrete memory less channel, Mutual information, Sources with finite memory, Markov sources, Shannon’s second fundamental theorem on coding, Huffman coding, Lempel – Ziv algorithm, Shannon-Fano algorithm.
Channel coding : Error detecting codes, Hamming distance, Error correcting codes, Repitition codes, Linear block codes, binary cyclic codes, BCH codes, Reed-Soleman codes, Golay codes.
Convolution Coding: Code tree, state diagram, Trellis diagram, Maximum-Likelihood decoding – Viterbi’s algorithm, sequential decoding.
Network Information theory, Introduction to Cryptography
Department of Computer Science and Engineering
19
BOOKS RECOMMENDED
1. T M Gover, J M Thomos, “Elements of Information Theory”, Wiley , 1991
2. Haykins S, “Digital Communications”, Wiley
3. J G Proakis, “ Digital Communications”, Mc Graw Hill.
4. Ballard and C.M.Brown, Computer Vision , Prentice Hall, Englewood Cliffs
5. Roman, S. Coding and Information Theory. New York: Springer-Verlag, 1992

Leave a Comment