Discrete Math. Modular Algebra, Cryptography, Encoding

The book contains the necessary information from universal and classic algebras, axiom systems for the main algebraic structures (groupoid, monoid, half -groups, groups, partial orders, rings, fields) The main cryptographic algorithms are described. Those who have become classic, noise -resistant codes are considered - linear, cyclic, overalls. Algorithms for designing such codes are given.
The book is based on many years of experience by the authors of the discipline "Discrete Mathematics" at the Faculty of Business Informatics, at the Faculty of Computer Sciences of the National Research University Higher School of Economics and at the Faculty of Automation and Computing Technology of the Moscow Energy Institute.
The book is intended for undergraduate students studying in areas 09.03.01 "Informatics and computer technology", 03/09/02 "Information Systems and Technologies", 03.03.03 "Applied Informatics", 03.03.04 "Program engineering", and Also for IT specialists and developers of software products.
The main theoretical and practical provisions, the presentation and analysis of practical algorithms illustrated by a large number of examples will allow you to form a strong theoretical base