Leírás
In computing, telecommunication, information theory, and coding theory, an error correcting code (ECC) is used for controlling errors in data over unreliable or noisy communication channels (wireless communication, data storage). The central idea is that the sender encodes the message with redundancy. In the r-fold repetition code, each bit is repeated r times. The price is that only 1/r part of the channel is used for the transmission of useful information. In my talk, I will present the mathematical background of error correcting codes, their parameters, and the most important constructions based on algebraic curves over finite fields. The second part of the talk will be about the difficulty of the decoding process. Surprisingly, this difficulty offers a way to construct cryptosystems which resist the attack of quantum computers.