M033 Coding
Faculty of InformaticsSpring 1997
- Extent and Intensity
- 2/1. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- prof. RNDr. Jan Paseka, CSc. (lecturer)
- Guaranteed by
- Contact Person: prof. RNDr. Jan Paseka, CSc.
- Prerequisites
- Before enrolling this course the students should go through M003 Linear Algebra and Geometry I, M011 Statistics I,M008 Algebra I and M000 Calculus I.
- 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
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Syllabus
- Introduction. A very abstract summary. History. Outline of the course.
- Entropy. Uncertainty. Entropy and its properties. Information.
- Communication trough 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.
- Language of instruction
- Czech
- Enrolment Statistics (Spring 1997, recent)
- Permalink: https://is.muni.cz/course/fi/spring1997/M033