Course detail

Coding in Informatics

FEKT-FKODAcad. year: 2012/2013

The course is devoted to the basic notions and methods of the coding theory.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

RNDr. Petr Fuchs, Ph.D.

Department

Department of Mathematics (UMAT)

Learning outcomes of the course unit

Upon successful completion of the course, students will be able to apply selected methods of coding on testing examples, to understand the theory on which the methods are based, and to follow contemporal development and applications of these methods.

Prerequisites

The knowledge of algebra, linear algebra and combinatorics on the bachelor degree level is required.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

Requirements for the completion of the course are specified by the lecturer responsible for the course.

Course curriculum

Introduction to coding theory, basic notions. Perfect codes. Linear codes. Hamming codes. Golay codes. Reed-Muller codes. Cyclic codes.

Work placements

Not applicable.

Aims

The aim of the course is to present basic notions and results in the coding theory including the most important historical examples.

Specification of controlled education, way of implementation and compensation for absences

The content and forms of the evaluated course are specified by the lecturer responsible for the course.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme BTBIO-F Master's

    branch F-BTB , 1 year of study, summer semester, compulsory

  • Programme EEKR-CZV lifelong learning

    branch EE-FLE , 1 year of study, summer semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

RNDr. Petr Fuchs, Ph.D.

Syllabus

1. Basic notions of coding theory. Huffman construction of the shortest code.
2. Block codes. Hamming distance.
3. Error detection and error correction.
4. Main coding theory problem. Perfect codes.
5. Basic algebraic notions - group, field, vector space.
6. Linear codes.
7. Generator and parity-check matrices.
8. Decoding linear codes. Syndromes.
9. Hamming codes.
10. Golay codes.
11. Reed-Muller codes.
12. Cyclic codes.
13. Historical oveview.

Exercise in computer lab

26 hod., compulsory

Teacher / Lecturer

RNDr. Petr Fuchs, Ph.D.