|
Lecturer(s)
|
-
Halaš Radomír, prof. Mgr. Dr.
|
|
Course content
|
1. Binary error-detecting and error-correcting codes, matrix codes, group (linear) codes, decoding of group codes. 2. Perfect and quasi-perfect codes, Hamming codes. 3. Polynomial codes. 4. Galois fields, cyclic multiplication groups of non-zero elements, primitive elements. 5. Extension of fields by means of polynomials. 6. BCH-codes. 7. Cyclic codes, generator and check polynomials and matrices. 8. Decoding the BCH-codes. 9. Reed-Solomon codes.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Master essential tools of the theory of error-detecting and error-correcting codes.
4. Analysis Analyse and compare classes of codes.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Dialog
Active participation in seminars. To apply the theory in problems.
|
|
Recommended literature
|
-
Adámek J. (1989). Kódování. SNTL Praha.
-
Birkhoff G., Bartee T. C. (1981). Aplikovaná algebra. Alfa Bratislava.
-
Jones G. A., Jones J. M. (2000). Information and coding theory. Springer London.
-
Van Lint J. H. (1999). Introductio to coding theory. Springer Berlin.
|