Representation Theory Group Rings And Coding Theory

This volume is dedicated to the memory of the Soviet mathematician S. D. Berman (1922-1987). Berman's work - for the most part in representation theory, group rings, and coding theory - is discussed here in a number of review articles. Among the topics covered are Berman's achievements in coding theory, including his pioneering work on abelian codes and his results on the theory of threshold functions. Also discussed are his contributions to the representation theory of groups over fields, his work on integral representations of groups, his accomplishments in infinite abelian group rings, and his fundamental results on units in integral group rings. In addition, there are 22 research articles written by an international group of researchers in areas of Berman's major interest.

The Mathematical Theory of Coding focuses on the application of algebraic and combinatoric methods to the coding theory, including linear transformations, vector spaces, and combinatorics. The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on self-dual and quasicyclic codes, quadratic residues and codes, balanced incomplete block designs and codes, bounds on code dictionaries, code invariance under permutation groups, and linear transformations of vector spaces over finite fields. The text then takes a look at coding and combinatorics and the structure of semisimple rings. Topics include structure of cyclic codes and semisimple rings, group algebra and group characters, rings, ideals, and the minimum condition, chains and chain groups, dual chain groups, and matroids, graphs, and coding. The book ponders on group representations and group codes for the Gaussian channel, including distance properties of group codes, initial vector problem, modules, group algebras, andrepresentations, orthogonality relationships and properties of group characters, and representation of groups. The manuscript is a valuable source of data for mathematicians and researchers interested in the mathematical theory of coding.

Representation Theory of Finite Groups is a five chapter text that covers the standard material of representation theory. This book starts with an overview of the basic concepts of the subject, including group characters, representation modules, and the rectangular representation. The succeeding chapters describe the features of representation theory of rings with identity and finite groups. These topics are followed by a discussion of some of the application of the theory of characters, along with some classical theorems. The last chapter deals with the construction of irreducible representations of groups. This book will be of great value to graduate students who wish to acquire some knowledge of representation theory.

This volume presents the proceedings from the conference on Abelian Groups, Rings, and Modules (AGRAM) held at the University of Western Australia (Perth). Included are articles based on talks given at the conference, as well as a few specially invited papers. The proceedings were dedicated to Professor László Fuchs. The book includes a tribute and a review of his work by his long-time collaborator, Professor Luigi Salce. Four surveys from leading experts follow Professor Salce's article. They present recent results from active research areas

After the pioneering work of Brauer in the middle of the 20th century in the area of the representation theory of groups, many entirely new developments have taken place and the field has grown into a very large field of study. This progress, and the remaining open problems (e.g., the conjectures of Alterin, Dade, Broué, James, etc.) have ensured that group representation theory remains a lively area of research. In this book, the leading researchers in the field contribute a chapter in their field of specialty, namely: Broué (Finite reductive groups and spetses); Carlson (Cohomology and representations of finite groups); Geck (Representations of Hecke algebras); Seitz (Topics in algebraic groups); Kessar and Linckelmann (Fusion systems and blocks); Serre (On finite subgroups of Lie groups); Thévenaz (The classification of endo-permutaion modules); and Webb (Representations and cohomology of categories).

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 Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research