Information theory
General data
Course ID: | 1000-2N03TI |
Erasmus code / ISCED: |
11.303
|
Course title: | Information theory |
Name in Polish: | Teoria informacji |
Organizational unit: | Faculty of Mathematics, Informatics, and Mechanics |
Course groups: |
(in Polish) Przedmioty obieralne na studiach drugiego stopnia na kierunku bioinformatyka Elective courses for Computer Science |
ECTS credit allocation (and other scores): |
6.00
|
Language: | English |
Type of course: | elective monographs |
Short description: |
Introduction into a theory which is useful in many application of informatics, like cryptography, modeling of natural language, and bio-informatics. The theory defines quantitative measures of information contained in a random variable or in a sequence of bits. It also provides criteria of optimal compressing (coding) of information, and of sending a message through an insecure channel. |
Full description: |
1.From the 20 questions game to the concept of entropy. Kraft inequality. Codes of Huffman and Shannon-Fano. 2.Conditional entropy, information. 3.The First Shannon Theorem about optimal encoding. 4.Channels, information lost, improving efficiency, channel capacity. 5.The Shannon Theorem about sending information through a noisy channel. 6.Information complexity by Kolmogorov. Chaitin number. 7.Kolmogorov's complexity vs.Shannon's entropy - universal test by Martin Loef. The course will be given in Polish, if no non-polish speaking students register for it. |
Bibliography: |
1. "Information and Coding Theory" by Gareth A. Jones and J. Mary Jones, Springer, 2000. 2. "Elements of Information Theory" by Thomas M. Cover and Joy A. Thomas, Wiley Series in Telecommunications, 1991. |
Learning outcomes: |
Knowledge Student -- understands basic concepts of information theory: entropy, mutual information, communication channel, channel capacity, Kolmogorov complexity, -- understands theoretical barriers to the efficiency of information encoding and reliable communication, -- understands the background of algorithms for text compression and error correction. Skills Students is able -- to apply the concept of entropy in data analysis, -- to compute the capacity of an information channel, -- to apply in practice algorithms of compression and error correction. Competence Student understands the mathematical aspect of the concept of information and is able to use it in system engineering, in particular to design networks and distributed systems, to manage memory etc., as well as in applications of informatics, in particular in data analysis, cryptography, and bioinformatics. |
Assessment methods and assessment criteria: |
The final grade is based on systematic work during the term, results of a mid-term class test and results of the written exam. |
Classes in period "Winter semester 2023/24" (past)
Time span: | 2023-10-01 - 2024-01-28 |
Navigate to timetable
MO CW
TU W WYK
CW
TH FR |
Type of class: |
Classes, 30 hours
Lecture, 30 hours
|
|
Coordinators: | Damian Niwiński | |
Group instructors: | Eryk Kopczyński, Damian Niwiński | |
Students list: | (inaccessible to you) | |
Examination: | Examination |
Classes in period "Winter semester 2024/25" (future)
Time span: | 2024-10-01 - 2025-01-26 |
Navigate to timetable
MO TU W TH FR |
Type of class: |
Classes, 30 hours
Lecture, 30 hours
|
|
Coordinators: | Damian Niwiński | |
Group instructors: | Eryk Kopczyński, Damian Niwiński | |
Students list: | (inaccessible to you) | |
Examination: | Examination |
Copyright by University of Warsaw.