Download Free Perfect Codes And Related Structures Book in PDF and EPUB Free Download. You can read online Perfect Codes And Related Structures and write the review.

In this monograph, we develop the theory of one of the most fascinating topics in coding theory, namely, perfect codes and related structures. Perfect codes are considered to be the most beautiful structure in coding theory, at least from the mathematical side. These codes are the largest ones with their given parameters. The book develops the theory of these codes in various metrics — Hamming, Johnson, Lee, Grassmann, as well as in other spaces and metrics. It also covers other related structures such as diameter perfect codes, quasi-perfect codes, mixed codes, tilings, combinatorial designs, and more. The goal is to give the aspects of all these codes, to derive bounds on their sizes, and present various constructions for these codes.The intention is to offer a different perspective for the area of perfect codes. For example, in many chapters there is a section devoted to diameter perfect codes. In these codes, anticodes are used instead of balls and these anticodes are related to intersecting families, an area that is part of extremal combinatorics. This is one example that shows how we direct our exposition in this book to both researchers in coding theory and mathematicians interested in combinatorics and extremal combinatorics. New perspectives for MDS codes, different from the classic ones, which lead to new directions of research on these codes are another example of how this book may appeal to both researchers in coding theory and mathematicians.The book can also be used as a textbook, either on basic course in combinatorial coding theory, or as an advance course in combinatorial coding theory.
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.
"Published in cooperation with NATO Emerging Security Challenges Division"--T.p.
The de Bruijn graph was defined in 1949 to enumerate the number of closed sequences where each n-tuple appears exactly once as a window in a sequence. Through the years, the graph and its sequences have found numerous applications – in space technology, wireless communication, cryptography, parallel computation, genome assembly, DNA storage, and microbiome research, among others. Sequences and the de Bruijn Graph: Properties, Constructions, and Applications explores the foundations of theoretical mathematical concepts and the important applications to computer science, electrical engineering, and bioinformatics. The book introduces the various concepts, ideas, and techniques associated with the use of the de Bruijn Graph, providing comprehensive coverage of sequence classification, one-dimensional and two-dimensional applications, graphs, interconnected networks, layouts, and embedded systems. Researchers, graduate students, professors, and professionals working in the fields of applied mathematics, electrical engineering, computer science and bioinformatics will find this book useful. - Investigates computational and engineering applications associated with the de Bruijn graph, its sequences, and their generalization - Explores one-dimensional and two-dimensional sequences with special properties and their various properties and applications - Introduces the rich structure of the de Bruijn graph and its sequences, in both mathematical theory and its applications to computing and engineering problems
Advances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.
This book constitutes the refereed proceedings of the Second International Conference in Cryptology in India, INDOCRYPT 2001, held in Chennai, India in December 2001. The 31 revised full papers presented together with an invited survey were carefully reviewed and selected from 77 submissions. The papers are organized in topical sections on hashing, algebraic schemes, elliptic curves, coding theory, applications, cryptanalysis, distributed cryptography, Boolean functions, digitial signatures, and shift registers.
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 coding theory apart from cryptography. Such conference took place at Mota Castle again and the number of participants was similar to the previous edition. The present edition of the conference, called III International Castle Meeting on Coding Theory and Applications has been held at Cardona Castle in Catalonia (Spain). The number of communications has increased and a number of selected papers will be published in a special issue of the journal Designs, Codes and Cryptography. As in the previous editions, the conference has been of high level with notorious invited speakers and scientic committee members.
The AAECC Symposia Series was started in 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the ?rst conference. Originally the acronym AAECC meant “Applied Algebra and Error-Correcting Codes”. Over the years its meaning has shifted to “Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes”, re?ecting the growing importance of complexity in both decoding algorithms and computational algebra. AAECC aims to encourage cross-fertilization between algebraic methods and their applications in computing and communications. The algebraic orientation is towards ?nite ?elds, complexity, polynomials, and graphs. The applications orientation is towards both theoretical and practical error-correction coding, and, since AAECC 13 (Hawaii, 1999), towards cryptography. AAECC was the ?rst symposium with papers connecting Gr ̈obner bases with E-C codes. The balance between theoretical and practical is intended to shift regularly; at AAECC-14 the focus was on the theoretical side. The main subjects covered were: – Codes: iterative decoding, decoding methods, block codes, code construction. – Codes and algebra: algebraic curves, Gr ̈obner bases, and AG codes. – Algebra: rings and ?elds, polynomials. – Codes and combinatorics: graphs and matrices, designs, arithmetic. – Cryptography. – Computational algebra: algebraic algorithms. – Sequences for communications.
The theory of algebraic function fields over finite fields has its origins in number theory. However, after Goppa`s discovery of algebraic geometry codes around 1980, many applications of function fields were found in different areas of mathematics and information theory. This book presents survey articles on some of these new developments. The topics focus on material which has not yet been presented in other books or survey articles.