
Information Coding
Code
11163
Academic unit
Faculdade de Ciências e Tecnologia
Department
Departamento de Informática
Credits
6.0
Teacher in charge
Carmen Pires Morgado, Pedro Abílio Duarte de Medeiros
Weekly hours
4
Total hours
52
Teaching language
Português
Objectives
The aim of this course is to introduce principles and main methods used in information coding to data transmition and storage.
The main fundamentals of information theory are studied and also how they are used to support techniques of data compression, error detection and correction and cryptography.
- Fundamental results of Information Theory and its contributions to information coding;
- Main techniques for data compression and error detection and correction;
- Main algorithms used in symmetric cryptography and public key and its analysis based on information theory concepts.
- Analyze and determine the efficiency of different compression techniques according to the data type handled;
- Analyze some of the implementations of algorithms used in cryptography;
- Development of simplified versions of algorithms for data compression, detection and error correction and encryption.
Subject matter
1 Introduction to information coding
- Building blocks of a digital communication/storage information system;
- Definition of information. Entropy. Source coding and the Shannon Theorem;
- Data coding: uniquely and instantaneous decodable codes, prefix codes.
2 Data compression
- Statistical and aritmetic coding
- Dictionary methods coding
- Context based coding
- Analysis of some compression methods
- Image, sound and video coding
3 Error detection and correction
- Noisy channels. Channel capacity theorem
- Error detection and correction methods: linear codes, cyclic codes, BCH and convolution
- Error detections and correction applications: ISBN ans similar, RAID and CD/DVD formats
4 Cryptographic Algorithms
- Relation between cryptography and information theory
- Symmetric cryptography
- Public Key cryptography
- Message Digest
- Steganography
Bibliography
- Class notes and other material available in CLIP
- Main references:
- D. Salomon, Coding for Data and Computer Communications, Springer, 2005
- Khalid Sayood, “Introduction to Data Compression”, 4th edition, Morgan Kaufmann, 2012
- J.Kurose and K. Ross, Computer Networking: A top down approach featuring the Internet, Addison-Wesley partes dos capítulos 5 7 e 8.
- Additional references:
- B. Forouzan, Data Communications 4th Ed, McGraw-Hill, 2007, partes dos capítulos 3, 4, 5, 10, 29 e 30
- F. Halsall, Multimedia Communications, Addison-Wesley, 2001
- R.Wells, Applied Coding and Information Theory for Engineers, Prentice-Hall, 1998
- Bruce Schneier, Applied Cryptography 2nd Ed, John Wiley & Sons, 1996
Evaluation method
Two evaluation tests
- Without consultation.
- Maximum duration: 2 hours.
- Each test covers approximately half of the syllabus.
Two lab works
- Work 1, related to some of the subjects of the first part of the program.
- Work 2, related to some of the subjects of the first part of the program.
Final grade calculation
Final grade = 0.3*test_1 + 0.3*test_2 + 0.20*work_1+ 0.20*work_2
Tests average >=8.5
Exam evaluation
- Students who failed the assessment throughout the semester are automatically accepted/enrolled for this evaluation.
- Exam without consultation.
- Maximun duration: 2h30m.
- Covers all the syllabus.
Exam evaluation grade
Final grade = 0.6*exam + 0.2*work_1+0.2*work_2
Exam grade >= 8.5