Scientific paper ID 1284 : 2016/2

The paper describes the processes of encoding and decoding using (15,11) Reed-Solomon code, based on Galois field GF(24), generated by a primitive irreducible polynomial f(x) = x4 + x + 1. An example for creating a generator polynomial of the Reed-Solomon code is given. This code will detect and correct errors occurring in two symbols of the codeword, as these symbols may be consecutive, i.e. in a series of 8 consecutive bits. The process of encoding a 44-bit information word is illustrated. After introducing errors in two symbols in the codeword, the processes of detecting and correcting errors in the codeword, and decoding are illustrated. The material is used in the course “Coding in Telecommunication Systems”, d as optional in the curriculum of the specialty “Telecommunication Systems” for the Bachelor degree.