In the new era of technology and advanced communications, coding theory and cryptography play a particularly significant role with a huge amount of research being done in both areas. This book presents some of that research, authored by prominent experts in the field.The book contains articles from a variety of topics most of which are from coding theory. Such topics include codes over order domains, Groebner representation of linear codes, Griesmer codes, optical orthogonal codes, lattices and theta functions related to codes, Goppa codes and Tschirnhausen modules, s-extremal codes, automorphisms of codes, etc. There are also papers in cryptography which include articles on extremal graph theory and its applications in cryptography, fast arithmetic on hyperelliptic curves via continued fraction expansions, etc. Researchers working in coding theory and cryptography will find this book an excellent source of information on recent research.Contents:The Key Equation for Codes from Order Domains (J B Little)A Gröbner Representation for Linear Codes (M Borges-Quintana et al.)Arcs, Minihypers, and the Classification of Three-Dimensional Griesmer Codes (H N Ward)Optical Orthogonal Codes from Singer Groups (T L Alderson & K E Mellinger)Codes over Fp2 and Fp x Fp, Lattices, and Theta Functions (T Shaska & C Shor)Goppa Codes and Tschirnhausen Modules (D Coles & E Previato)Remarks on s-Extremal Codes (J-L Kim)Automorphism Groups of Generalized Reed-Solomon Codes (D Joyner et al.)About the Code Equivalence (I G Bouyukliev)Permutation Decoding for Binary Self-Dual Codes from the Graph Qn Where n is Even (J D Key & P Seneviratne)The Sum-Product Algorithm on Small Graphs (M E O'Sullivan et al.)On the Extremal Graph Theory for Directed Graphs and Its Cryptographical Applications (V A Ustimenko)Fast Arithmetic on Hyperelliptic Curves via Continued Fraction Expansions (R Scheidler et al.)The Number of Inequivalent Binary Self-Orthogonal Codes of Dimension 6 (X-D Hou)Readership: Researchers in coding theory and cryptography.