Table of Contents:
  • Supports of a Code / L.A. Bassalygo
  • Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science / C. Benecke, R. Grund, R. Hohberger, A. Kerber, R. Laue and T. Wieland
  • On Algebraic Methods in Covering Radius Problems / I. Honkala, S. Litsyn and A. Tietavainen
  • How Lower and Upper Complexity Bounds Meet in Elimination Theory / L.M. Pardo
  • Bivariate Polynomial Multiplication Patterns / A. Schonhage
  • Division of Entire Functions by Polynomial Ideals / J. Apel
  • Variations on Minimal Codewords in Linear Codes / A. Ashikhmin, A. Barg, G. Cohen and L. Huguet
  • On the Computation of the Radical of Polynomial Complete Intersection Ideals / I. Armendariz and P. Solerno
  • Which Families of Long Binary Linear Codes Have a Binomial Weight Distribution? / T. Beth, H. Kalouti and D.E. Lazic
  • The Discovery of Simple 7-Designs with Automorphism Group P[gamma]L(2,32) / A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann.