Jon-Lark Kim – författare

This original monograph investigates several unsolved problems that currently exist in coding theory. A highly relevant branch of mathematical computer science, the theory of error-correcting codes is concerned with reliably transmitting data over a ‘noisy’ channel. Despite its fairly long history and consistent prominence, the field still contains interesting problems that have resisted solution by some of the most prominent mathematicians of recent decades.

Employing SAGE—a free open-source mathematics software system—to illustrate ideas, this book is intended for graduate students and researchers in algebraic coding theory, especially those who are interested in finding some current unsolved problems. Familiarity with concepts in algebra, number theory, and modular forms is assumed. The work may be used as supplementary reading material in a graduate course on coding theory or for self-study.

Mathematicians Playing Games explores a wide variety of popular mathematical games, including their historical beginnings and the mathematical theories that underpin them. Its academic level is suitable for high school students and higher, but people of any age or level will find something to entertain them, and something new to learn. It would be a fantastic resource for high school mathematics classrooms or undergraduate mathematics for liberal arts course and belongs on the shelf of anyone with an interest in recreational mathematics.

Features

Mathematicians Playing Games explores a wide variety of popular mathematical games, including their historical beginnings and the mathematical theories that underpin them. Its academic level is suitable for high school students and higher, but people of any age or level will find something to entertain them, and something new to learn. It would be a fantastic resource for high school mathematics classrooms or undergraduate mathematics for liberal arts course and belongs on the shelf of anyone with an interest in recreational mathematics.

Features

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry.

Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references.

The book is divided into three parts:

Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds

Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs

Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography.

Features

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry.

Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references.

The book is divided into three parts:

Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds

Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs

Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography.

Features