English

Not applicable.

Students should have the knowledge of linear algebra and combinatorics at the bachelor degree level; in particular, they shoud be able to add and multiply vectors matrices, solve systems of linear equations, and compute the number of choices of k elements from an n-element set.

Maximum 25 points for control tests and activities during the semester (at least 10 points for the course-unit credit); maximum 75 points for a written exam.

The goal of the course is to explain basic concepts and computational methods of the coding theory.
After completing the course, students should be able to:
- construct the shortest binary code using the Huffman algorithm;
- find the minimum distance of a block code;
- decide about the linearity of a block code;
- deduce the generator and parity-check matrices of a linear code;
- decode with the nearest neighbour method and using syndromes.

Not applicable.

Not applicable.

ADÁMEK, Jiří: Kódování. Praha, SNTL, 1989. (CS)

ZNÁM, Štefan: Teória čísel. Bratislava, Alfa, 1977. (SK)