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 topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography. The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event’s scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community.

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

This book constitutes the refereed proceedings of the 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, held in Vihula, Estonia, in August 2017. The 24 full papers presented were carefully reviewed and selected for inclusion in this volume. The papers cover relevant research areas in modern coding theory, including codes and combinatorial structures, algebraic geometric codes, group codes, convolutional codes, network coding, other applications to communications, and applications of coding theory in cryptography.

This volume contains the proceedings of the 17th International Conference on Arithmetic, Geometry, Cryptography and Coding Theory (AGC2T-17), held from June 10–14, 2019, at the Centre International de Rencontres Mathématiques in Marseille, France. The conference was dedicated to the memory of Gilles Lachaud, one of the founding fathers of the AGC2T series. Since the first meeting in 1987 the biennial AGC2T meetings have brought together the leading experts on arithmetic and algebraic geometry, and the connections to coding theory, cryptography, and algorithmic complexity. This volume highlights important new developments in the field.

The theory developed for Z2Z4-additive codes is the starting point for much generalization about codes over mixed alphabets. They have opened a new, emergent area of research. The techniques used for Z2Z4-linear codes are being generalized and applied to more general codes. By example, these codes have contributed to the classification of many nonlinear codes. Moreover, they can be considered as the starting point of many different generalizations given over mixed alphabets, thereby representing a useful area of research. Since 2010, more than 30 papers have been published about the codes considered in the book, which includes important classes of binary codes (1-perfect, Hadamard, etc.) that are not linear in general. For example, much recent research has shown the application of the techniques described for the family of cyclic Z2Z4-linear codes. Topics and Features: Examines everything from the basic definitions to very advanced results Provides numerous examples, succinctly and comprehensively gathering and using the relevant information Includes examples using commands from a new Magma package, developed mostly by the same authors Proposes algorithms, for instance to describe coding and decoding strategies This unique volume will be eminently suitable for researchers working on coding theory over rings, especially over mixed alphabets. Experts will find commands and algorithms that will be useful in the generalization to codes over mixed alphabets. Additionally, by outlining the basic theory of codes over mixed alphabets and providing numerous examples, the book will be useful to researchers wanting to be introduced to the topic. The authors are all affiliated with the Dept. of Information and Communications Engineering at the Universitat Autònoma de Barcelona, Spain. Joaquim Borges and Cristina Fernández-Córdoba are Associate Professors, Jaume Pujol is a now retired Associate Professor, Josep Rifà is Professor Emeritus, and Mercè Villanueva is Associate Professor.

This book constitutes the proceedings of the 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014, held in Copenhagen, Denmark, in May 2014. The 38 full papers included in this volume were carefully reviewed and selected from 197 submissions. They deal with public key cryptanalysis, identity-based encryption, key derivation and quantum computing, secret-key analysis and implementations, obfuscation and multi linear maps, authenticated encryption, symmetric encryption, multi-party encryption, side-channel attacks, signatures and public-key encryption, functional encryption, foundations and multi-party computation.

This book constitutes the refereed proceedings of the 2nd International Castle Meeting, ISMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 2008. The 14 full papers and 5 invited papers presented were carefully reviewed and selected from 34 submissions for inclusion in the book. The papers cover network coding, quantum codes, group codes, codes and combinatorial structures, agebraic-geometry codes, as well as codes and applications.