Information Theory & Coding - [2710502]

 Download

Teaching Scheme

Theory
Tutorial Practical Total
4 2 2 8

Examination Scheme

Theory Examination Practical Examination Total
ESE (E) PA (M) ESE Viva (V) PA (I)
- - - - -

    ESE = End Semester Examination, PA = Progressive Assessment


Semester   
:   
1
Course Type   
:   
Communication
Credit   
:   
6

Syllabus Content

Basic concept of coding, Unique decodable codes and instantaneous decodable codes (IDC) Construction of IDC, Krafts inequality and MC Millan’s theorem, Huffman and shannon - fano code.
Entropy, Entropy of sources and their extension. Loss less image compression
Basic of channel coding and Hamming distances, channel capacity and shannon’s fundamental theorem
Systematic linear codes and optimum decoding for the binary symmetric channel; Generator and parity Check Matrices Syndrome decoding on symmetric channels; Hamming codes
Cyclic code, Burst errors, BCH Code, Reedsolomon Codes
Convolution codes, Viterbi decoding algorithm
Wozencraft’s sequential decoding algorithm, Fann’s algorithm and other sequential decoding algorithms

Reference Books

SrTitleAuthorPublicationAmazon Link
1Foundation of codingJiri AdamekJohn Wiley and sons
2Principal of Digital Communication and CodingA.J. Viterbi and J.K.OrmuraMcGraw Hill
3Digital communication fundamental and ApplicationBernard SklarPE India
4Information and CodingN. AbramsonMcGraw Hill,1963
5Information TheoryR.B.AshPrentice Hall,1970

Course Outcome

Course Outcome:

1. To obtain an understanding of the theoretical principles of source coding.

2. To focus on the application of Information Theory to communications in general and on channel coding and capacity in particular.

3. To analyze various error correcting codes.

4. To compare coded Vs. uncoded system.

5. To Use MATLAB for analysis of various source coding and channel coding techniques.