scientific article; zbMATH DE number 1348639

From MaRDI portal
Publication:4264755





This book incorporates the use of the Maple software system into a study of combinatorics, error-correcting codes and cryptography to give students the ability to see realistic examples of the material ``without having to struggle with extensive computations. All Maple material has been separated into separate sections to allow their more general use. Three short appendices review features of Maple, the linear algebra package of Maple and the user-defined procedures of Maple for the material of the later chapters, respectively. The first chapter reviews the basic mathematics that will be used throughout the text, including a discussion of finite fields and how Maple implements them. The combinatorics of the book includes chapter 2 on block designs and chapter 11 on Polya theory. Chapters 3, 4 and 5 cover error-correcting codes, including an introduction to codes, Reed-Muller codes, Hamming codes, BCH and Reed-Solomon codes. Chapters 4 and 5 have sections on how the coding and decoding algorithms for BCH and RS codes are implemented in Maple. The next three chapters discuss cryptography with chapters on the classical cryptosystem of Hill, RSA cryptosystems and elliptic curve cryptosystems (over prime fields rather than fields of characteristic two). The material can be used by students who have had a course on linear and abstract algebra. It easily achieves its aim of integrating the mathematical material with implementations that will give students a practical facility with the theoretical concepts involved.





Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264755)