Böcker i Discrete Mathematics and Its Applications-serien

An exploration of applied mathematical modelling, covering a broad range of applications. It stresses a multidisciplinary approach that illustrates the entire development of a model, from formulation to analysis to implementation. There are case studies spanning the mathematical sciences.

Placing combinatorial and graph-theoretical tools at the forefront of the development of matrix theory, this book uses graphs to explain basic matrix construction, formulas, computations, ideas, and results.

Covers the constructions of designs, existence results, properties of designs, and applications of designs. This book contains chapters on the history of design theory, various codes, bent functions, and numerous designs as well as tables, including BIBDs, PBDs, MOLS, and Hadamard matrices.

Covers core areas such as sequences, recursions, generating functions, evaluation of sums, and graphs. This book discusses topics like partitions and polynomials, algebraic counting, and designs.

Collecting some of the most popular graph algorithms and optimization procedures, this book provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization.

Includes two chapters on various applications that cover topics such as electronic mail, Internet security, protocol layers and SSL, firewalls, client-server model and cookies, network security, wireless security, smart cards, and biometrics. This book provides information on cryptanalysis, primality testing, DES, and primitive roots.

Covers the subject of computational group theory (CGT). This book describes the connections between the different aspects of CGT and other areas of computer algebra. It is suitable for graduate students who have some knowledge of group theory and computer algorithms.

Introduces the theory and algorithms involved in curve-based cryptography. This book provides ready-to-implement algorithms for the group operations and computation of pairings. It explores methods for point counting and constructing curves with the complex multiplication method and provides algorithms.

Presents working algorithms and implementations that can be used to design and create real systems. This book emphasises on the underlying concepts governing information theory and the mathematical basis for modern coding systems. It also provides the practical details of important codes like Reed-Solomon, BCH, and Turbo codes.