Designs, Codes and Cryptography, Volume 14, 1998

Volume 14, Number 1, April 1998

• Frank E. Bennett, Jianxing Yin, Hantao Zhang, R. Julian R. Abel:
  Perfect Mendelsohn Packing Designs with Block Size Five. 5-22
  
• Sergei V. Bezzateev, Natalia A. Shekhunova:
  A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension. 23-38
  
• David B. Jaffe, Vladimir D. Tonchev:
  Computing Linear Codes and Unitals. 39-52
  
• Marc Joye, Jean-Jacques Quisquater:
  Reducing the Elliptic Curve Cryptosystem of Meyer-Müuller to the Cryptosystem of Rabin-Williams. 53-56
  
• Çetin Kaya Koç, Tolga Acar:
  Montgomery Multplication in GF(2^k). 57-69
  
• Tero Laihonen, Simon Litsyn:
  On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. 71-80
  
• A. Mahmoodi:
  Existence of Perfect 3-Deletion-Correcting Codes. 81-87
  
• Antonio Maschietti:
  Difference Sets and Hyperovals. 89-98
  

Volume 14, Number 2, May 1998

• Alexei E. Ashikhmin:
  On Generalized Hamming Weights for Galois Ring Linear Codes. 107-126
  
• Aiden A. Bruen, Keldon Drudge:
  On the Non-Existence of Certain Cameron-Liebler Line Classes in PG(3, q). 127-132
  
• Claude Carlet, Philippe Guillot:
  An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness. 133-140
  
• Charles J. Colbourn, Alan C. H. Ling:
  Point Code Minimum Steiner Triple Systems. 141-146
  
• Yury J. Ionin:
  A Technique for Constructing Symmetric Designs. 147-158
  
• Volker Müller, Scott A. Vanstone, Robert J. Zuccherato:
  Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. 159-178
  
• Juriaan Simonis, Alexei E. Ashikhmin:
  Almost Affine Codes. 179-197
  

Volume 14, Number 3, September 1998

• Amir H. Banihashemi, Amir K. Khandani:
  An Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions. 207-212
  
• Harald Fripertinger:
  Enumeration, Construction and Random Generation of Block Codes. 213-219
  
• He Jingmin, Ed Dawson:
  Shared Secret Reconstruction. 221-237
  
• Philippe Langevin:
  Weights of Abelian Codes. 239-245
  
• Kenneth G. Paterson:
  Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. 247-259
  
• Douglas R. Stinson, Tran van Trung:
  Some New Results on Key Distribution Patterns and Broadcast Encryption. 261-279
  
• Marten van Dijk, Christian Gehrmann, Ben J. M. Smeets:
  Unconditionally Secure Group Authentication. 281-296
  

Last update Mon May 20 16:57:34 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page