A Diametric Theorem in for Lee and Related Distances -- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) -- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm -- How to Know if a Linear Code Is a Group Code? -- Witness Sets -- On Rank and Kernel of ?4-Linear Codes -- Classic and Quantum Error Correcting Codes -- Evaluating the Impact of Information Distortion on Normalized Compression Distance -- Codes from Expander Graphs -- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation -- Minimal Trellis Construction for Finite Support Convolutional Ring Codes -- On the Quasi-cyclicity of the Gray Map Image of a Class of Codes over Galois Rings -- Algebraic Geometry Codes from Castle Curves -- Two-Point Codes on Norm-Trace Curves -- Close Encounters with Boolean Functions of Three Different Kinds -- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization -- On the Kronecker Product Construction of Completely Transitive q-Ary Codes -- Quaternary Unequal Error Protection Codes -- Communication on Inductively Coupled Channels: Overview and Challenges.

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.