You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This is a concise, easy-to-read guide, introducing beginners to coding theory and information theory.
Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and
Multiplicative invariant theory, as a research area in its own right within the wider spectrum of invariant theory, is of relatively recent vintage. The present text offers a coherent account of the basic results achieved thus far.. Multiplicative invariant theory is intimately tied to integral representations of finite groups. Therefore, the field has a predominantly discrete, algebraic flavor. Geometry, specifically the theory of algebraic groups, enters through Weyl groups and their root lattices as well as via character lattices of algebraic tori. Throughout the text, numerous explicit examples of multiplicative invariant algebras and fields are presented, including the complete list of all multiplicative invariant algebras for lattices of rank 2. The book is intended for graduate and postgraduate students as well as researchers in integral representation theory, commutative algebra and, mostly, invariant theory.
In 1999, a conference called International Meeting on Coding Theory and Cryptography took place at Mota Castle in Castilia (Spain). The conference had great acceptance within the community of coding theory and cryptography researchers. At that moment, and also nowadays, there are not many international workshops about these topics, at least if we compare with other mathematical and engineering subjects of research. Therefore, the general desire was to continue with more Castle Meetings. However, the following conference did not take place until 2008. In that case, the conference was called II International Castle Meeting on Coding Theory and Applications allowing more topics related to codin...
This volume contains the proceedings of the 11th International Conference on Finite Fields and their Applications (Fq11), held July 22-26, 2013, in Magdeburg, Germany. Finite Fields are fundamental structures in mathematics. They lead to interesting deep problems in number theory, play a major role in combinatorics and finite geometry, and have a vast amount of applications in computer science. Papers in this volume cover these aspects of finite fields as well as applications in coding theory and cryptography.
This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest.