M8170 Coding
Faculty of ScienceSpring 2007
- Extent and Intensity
- 2/1/0. 3 credit(s) (fasci plus compl plus > 4). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Jan Paseka, CSc. (lecturer)
- Guaranteed by
- prof. RNDr. Jan Paseka, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: prof. RNDr. Jan Paseka, CSc. - Timetable
- Fri 13:00–14:50 N41
- Timetable of Seminar Groups:
- Prerequisites
- Mathematical analysis I. and II., Linear algebra and geometry I. and II. , Fundamentals of mathematics, Algebra I, Probability and Statistics.
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, B-IN)
- Informatics (programme FI, D-IN)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Mathematics (programme PřF, B-MA)
- Mathematics (programme PřF, M-MA)
- Mathematics (programme PřF, N-MA)
- Course objectives
- The basic goal of the lecture is the introduction of the student to establish the mathematical basics of the coding theory. Some applications of the coding theory are mentioned.
- Syllabus
- Introduction. A very abstract summary. History. Outline of the course. Entropy. Uncertainty. Entropy and its properties. Information. Communication through channels. The discrete memoryless channel. Codes and decoding rules. The noisy coding theorem. Error-correcting codes. The coding problem - need for error correction. Linear codes. Binary Hamming codes. Cyclic codes. Reed--Muller codes. General sources. The entropy of a general source. Stationary sources. Markov sources. The structure of natural languages. English as a mathematical source. The entropy of English.
- Literature
- Adámek, Jiří. Foundations of coding, John Wiley \& Sons, Inc. 1991
- Hamming, R. W. Coding and information theory, Prentice-Hall, New-Jersey 1950
- : Welsh D., Codes and cryptography, Oxford, University Press, New York, 1988
- Roman, Steven, Coding and Information Theory, Graduate Texts in Mathematics, Springer Verlag, 1992
- ADÁMEK, Jiří. Kódování. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1989, 191 s. URL info
- Assessment methods (in Czech)
- Zkouška je ústní. Je nutná aktivní účast na cvičeních nebo zpracování písemného referátu, který bude následně přednesen na některém ze cvičení. Téma bude stanoveno po dohodě s vyučujícím.
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- The course is taught once in two years.
- Teacher's information
- http://www.math.muni.cz/~paseka
- Enrolment Statistics (Spring 2007, recent)
- Permalink: https://is.muni.cz/course/sci/spring2007/M8170