Scribd
Upload
94 views

EC401 Information Theory & Coding

This document outlines an Information Theory and Coding course offered in 2016. The course objectives are to introduce information theory concepts and coding techniques for reliable data transmission over noisy channels. The syllabus covers source coding, channel capacity, linear block codes, cyclic codes, convolutional codes and decoding algorithms. Students are expected to apply Shannon's source and channel coding theorems to design efficient communication systems and analyze various coding schemes and decoders. The course is divided into 6 modules taught over 54 hours and assessed via internal exams, assignments and an end semester exam.

Uploaded by

Pavithra A B
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
94 views

EC401 Information Theory & Coding

This document outlines an Information Theory and Coding course offered in 2016. The course objectives are to introduce information theory concepts and coding techniques for reliable data transmission over noisy channels. The syllabus covers source coding, channel capacity, linear block codes, cyclic codes, convolutional codes and decoding algorithms. Students are expected to apply Shannon's source and channel coding theorems to design efficient communication systems and analyze various coding schemes and decoders. The course is divided into 6 modules taught over 54 hours and assessed via internal exams, assignments and an end semester exam.

Uploaded by

Pavithra A B
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

COURSE YEAR OF

CODE COURSE NAME L-T-P-C INTRODUCTION


EC401 INFORMATION THEORY & CODING 4-0-0-4 2016
Prerequisite: EC302 Digital Communication
Course objectives:
 To introduce the concept of information
 To understand the limits of error free representation of information signals and the
transmission of such signals over a noisy channel
 To design and analyze data compression techniques with varying efficiencies as per
requirements
 To understand the concept of various theorems proposed by Shannon for efficient data
compression and reliable transmission
 To give idea on different coding techniques for reliable data transmission
 To design an optimum decoder for various coding schemes used.
Syllabus: Concept of amount of information, Entropy, Source coding, Channel Capacity, Shannon’s
Limit, Rate Distortion Theory, Channel Coding, Linear Block Codes, Cyclic codes, Cryptography,
Convolutional Codes, Viterbi Algorithm
Expected outcome:
The students will be able to
i. Apply the knowledge of Shannon’s source coding theorem and Channel coding theorem for
designing an efficient and error free communication link.
ii. Analyze various coding schemes
iii. Design an optimum decoder for various coding schemes used.
Text Books:
1. P S Sathya Narayana, Concepts of Information Theory & Coding, Dynaram Publications,
2005
2. Simon Haykin: Digital Communication Systems, Wiley India, 2013.
References:
1. Bose, Information theory coding and cryptography, 3/e McGraw Hill Education India , 2016
2. D.E.R. Denning, Cryptography and Data Security, Addison Wesley, 1983.
3. J S Chitode, Information Theory and Coding, Technical Publications, Pune, 2009
4. Kelbert & Suhov, Information theory and coding by examples, Cambridge University Press,
2013
5. Shu Lin & Daniel J. Costello. Jr., Error Control Coding : Fundamentals and Applications,
2/e, Prentice Hall Inc., Englewood Cliffs, NJ,2004
Course Plan
End
Sem.
Module Course contents Hours
Exam
Marks
Introduction to Information Theory. Concept of information, units,
entropy, marginal, conditional and joint entropies, relation among
I entropies, mutual information, information rate. 9 15%
Source coding: Instantaneous codes, construction of instantaneous
codes, Kraft‘s inequality, coding efficiency and redundancy
Noiseless coding theorem , construction of basic source codes,
II Shannon – Fano Algorithm, Huffman coding, 9 15%
Channel capacity – redundancy and efficiency of a channel, binary
symmetric channel (BSC), Binary erasure channel (BEC) – capacity
of band limited Gaussian channels
FIRST INTERNAL EXAM
Continuous Sources and Channels: Differential Entropy, Mutual
information,
III Waveform channels, Gaussian channels, Shannon – Hartley theorem, 9 15%
bandwidth, SNR trade off, capacity of a channel of infinite
bandwidth, Shannon‘s limit
Introduction to rings, fields, and Galois fields. Codes for error
detection and correction – parity check coding – linear block codes –
IV 9 15%
error detecting and correcting capabilities – generator and parity
check matrices – Standard array and syndrome decoding
SECOND INTERNAL EXAM
Perfect codes, Hamming codes, encoding and decoding
Cyclic codes, polynomial and matrix descriptions, generation of
V 9 20%
cyclic codes, decoding of cyclic codes
BCH codes, Construction and decoding, Reed Solomon codes
Convolutional Codes – encoding – time and frequency domain
approaches, State Tree & Trellis diagrams – transfer function and
VI 9 20%
minimum free distance – Maximum likelihood decoding of
convolutional codes – The Viterbi Algorithm. Sequential decoding.
END SEMESTER EXAM

Question Paper

The question paper shall consist of three parts. Part A covers modules I and II, Part B covers
modules III and IV, and Part C covers modules V and VI. Each part has three questions
uniformly covering the two modules and each question can have maximum four subdivisions.
In each part, any two questions are to be answered. Mark patterns are as per the syllabus with
50% for theory and 50% for logical/numerical problems, derivation and proof.

You might also like