Lecture topics:
1) Introduction. (n, M, d)-codes, Hamming distance
2) Main problem of Coding Theory. Equivalence of codes. Necessary and sufficient condition for the existence of a (n, M, d)-codes, perfect codes.
3) Block designs in Coding Theory.
4) Finite fields and vector spaces.
5) Linear codes. Linear codes, equivalence of linear codes. Coding and decoding, error detection.
6) Dual codes. Syndrome decoding.
7) Hamming codes. Binary and extended Hamming codes.
8) Perfect codes.
9) Cyclic codes. Polynomials, binary a ternary Golay codes.
1) Introduction. (n, M, d)-codes, Hamming distance
2) Main problem of Coding Theory. Equivalence of codes. Necessary and sufficient condition for the existence of a (n, M, d)-codes, perfect codes.
3) Block designs in Coding Theory.
4) Finite fields and vector spaces.
5) Linear codes. Linear codes, equivalence of linear codes. Coding and decoding, error detection.
6) Dual codes. Syndrome decoding.
7) Hamming codes. Binary and extended Hamming codes.
8) Perfect codes.
9) Cyclic codes. Polynomials, binary a ternary Golay codes.