Foreword: Computer Algebra in Coding Theory and Cryptography
General coding theory. In Efficient representation of binary nonlinear codes: constructions and minimum distance computation M. Villanueva, F. Zeng and J. Pujol give a representation of a binary nonlinear code and compute its minimum distance from such a representation. The complexity of this approach is given in terms of the work factor. The paper Heuristic Decoding of Linear Codes Using Commutative Algebra by N. Dück and K.-H. Zimmermann shows a new heuristic decoding method based on the ordinary code ideal. In Optimal codes as Tanner codes with cyclic component codes the authors, T. Høholdt, F. Piñero and P. Zeng, study a class of graph codes with cyclic code component codes and they find some optimal binary codes.
Algebraic geometry codes. The paper An improvement of the Feng-Rao bound for primary codes, by O. Geil and S. Martin, poses a new bound for the minimum distance of a general primary linear code that in some families of codes is often an improvement on the Feng-Rao bound for primary codes. In The second generalized Hamming weight of certain Castle codes, W. Olaya-Léon and C. Granados-Pinzón examine a bound on the second generalized Hamming weight for some AG codes coming from Castle curves related to Weierstrass semigroups generated by two integers. The paper Quantum codes from affine variety codes and their subfield-subcodes, by C. Galindo and F. Hernando, presents and analyzes a construction of quantum stabilizer codes from affine variety codes and their subfield-subcodes.
Cryptography. In Hamming codes for wet paper steganography, by C. Munuera, the author describes an application of Hamming codes to wet paper steganography with the remarkable property of using decoding algorithms that do not satisfy the minimum distance property. Finally, the paper Theory of 2-rotation symmetric cubic Boolean functions, by T. W. Cusick and B. Johns, provides a complete description of that family of Boolean functions.