The theory developed for ?2?4-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 ?2?4-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 ?2?4-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.