Module Catalogues, Xi'an Jiaotong-Liverpool University   
 
Module Code: EEE315
Module Title: Information Theory and coding
Module Level: Level 3
Module Credits: 2.50
Academic Year: 2018/19
Semester: SEM1
Originating Department: School of Advanced Technology
Pre-requisites: N/A
   
Aims
To introduce the concept of entropy and Shannon’s Theorems in information theory;

To introduce the concept of channel capacity under the influence of noise from information theory point of view;


To provide the fundamental knowledge of source coding, channel coding and cryptography.

Learning outcomes 
A. Explain the concept of entropy, relative entropy and mutual information;

B. Elaborate on Shannon’s Theorems and the significance;

C. Design source coding for data compression;

D. Identify the importance of channel capacity and its connection to mutual information;

E. Design channel coding for error correction;

F. Design basic encryption/decryption algorithms to provide secrecy of information.

Method of teaching and learning 
This module will be delivered through a combination of formal lectures and tutorials.
Syllabus 
1 Introduction


Information source and representation; Noises and errors; Probability and random processes.


2 Source and Entropy


Shannon Information Content; Entropy of a source; Joint entropy and chain rule; Relative entropy; Mutual Information; Jensen’s Inequality and data processing inequality.


3 Data Compression and source coding


Shannon’s first theorem on source coding; Source encoder/decoder; Type of source codes; Prefix code; Kraft Inequality; Shannon codes; Huffman codes; Extended Huffman codes.


4 Channel Capacity


Discrete memoriless channel; Mutual information and channel capacity; Symmetric channel and binary symmetric channel; Transition probability matrix; Entropy rate; Shannon’s second theorem.


5 Channel Coding


Error control coding; Linear block codes; Hamming distance; Least distance decoding; Perfect codes; Generator matrix; Parity-check matrix; Syndrome decoder.


6 Hamming Codes


Hamming coding; Dual codes; Expanded Hamming codes; Systematic and Nonsystematic Hamming codes; Performance of linear block codes; Forward error correction.


7 Cyclic Codes


Polynomial representation; Polynomial modulo arithmetic; Systematic and non-systematic cyclic codes; Generation and decoding of cyclic codes.


8 Cryptology


Cryptosystems; Keys in Cryptology; Symmetric Key Cryptosystem; Simple Cipher System; Shannon’s theorem for Perfect Secrecy; Asymmetric Key Cryptosystem; Private and Public Key Encryption; Rivest-Shamir-Adleman (RSA) public key system; Prime numbers and factorization.

Delivery Hours  
Lectures Seminars Tutorials Lab/Prcaticals Fieldwork / Placement Other(Private study) Total
Hours/Semester 20    6      49  75 

Assessment

Sequence Method % of Final Mark
1 Assignment 1 – Wk5 10.00
2 Assignment 2 – Wk12 10.00
3 Final Exam 80.00

Module Catalogue generated from SITS CUT-OFF: 8/24/2019 3:33:53 PM