7. IMA 1999: Cirencester, UK

• Kenneth G. Paterson:
  Applications of Exponential Sums in Communications Theory. 1-24
  
• Svetla Nikova, Ventzislav Nikov:
  Some Applications of Bounds for Designs to the Cryptography. 25-34
  
• Enes Pasalic, Thomas Johansson:
  Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions. 35-44
  
• Edgar Martínez-Moro, F. Javier Galán-Simón, Miguel A. Borges-Trenard, Mijail Borges-Quintana:
  Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics. 45-55
  
• Helen Donelan, Timothy O'Farrell:
  A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System. 56-62
  
• Stelios Georgiou, Christos Koukouvinos:
  New Self-Dual Codes over GF(5). 63-69
  
• Eric Filiol:
  Designs, Intersecting Families, and Weight of Boolean Functions. 70-80
  
• Sean McGrath:
  Coding Applications in Satellite Communication Systems. 81-83
  
• Xian Liu, Patrick G. Farrell, Colin Boyd:
  A Unified Code. 84-93
  
• Paul Chippendale, Cagri Tanriover, Bahram Honary:
  Enhanced Image Coding for Noisy Channels. 94-103
  
• George I. Davida, Yair Frankel:
  Perfectly Secure Authorization and Passive Identification for an Error Tolerant Biometric System. 104-113
  
• Thumrongrat Amornraksa, David R. B. Burgess, Peter Sweeney:
  An Encoding Scheme for Dual Level Access to Broadcasting Networks. 114-118
  
• Bruno Bellamy, John S. Mason, Michael Ellis:
  Photograph Signatures for the Protection of Identification Documents. 119-128
  
• Jean-Pierre Tillich, Gilles Zémor:
  An Overview of the Isoperimetric Method in Coding Theory. 129-134
  
• Johannes Maucher, Vladimir Sidorenko, Martin Bossert:
  Rectangular Basis of a Linear Code. 135-143
  
• Patrick G. Farrell, Seyed H. Razavi:
  Graph Decoding of Array Error-Correcting Codes. 144-152
  
• Conor O'Donoghue, Cyril Burkley:
  Catastrophicity Test for Time-Varying Convolutional Encoders. 153-162
  
• Min-seok Oh, Peter Sweeney:
  Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes. 163-172
  
• Graham H. Norton, Ana Salagean:
  On Efficient Decoding of Alternant Codes over a Commutative Ring. 173-178
  
• Jihye Gwak, Sooyoung Kim Shin, Hyung-Myung Kim:
  Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes. 179-184
  
• Lars R. Knudsen:
  Advanced Encryption Standard (AES) - An Update. 185
  
• Zsolt Kukorelly:
  The Piling-Up Lemma and Dependent Random Variables. 186-190
  
• Steven D. Galbraith, Nigel P. Smart:
  A Cryptographic Application of Weil Descent. 191-200
  
• Renato Menicocci, Jovan Dj. Golic:
  Edit Probability Correlation Attack on the Bilateral Stop/Go Generator. 201-212
  
• M. Anwarul Hasan:
  Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. 213-221
  
• Siguna Müller:
  On the Combined Fermat/Lucas Probable Prime Test. 222-235
  
• Solomon W. Golomb:
  On the Cryptanalysis of Nonlinear Sequences. 236-242
  
• Simon Blake-Wilson:
  Securing Aeronautical Telecommunications. 243
  
• Roger Fischlin, Jean-Pierre Seifert:
  Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography. 244-257
  
• Yi Mu, Vijay Varadharajan, Khanh Quoc Nguyen:
  Delegated Decryption. 258-269
  
• Boris Ryabko, Andrei Fionov:
  Fast and Space-Efficient Adaptive Arithmetic Coding. 270-279
  
• Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi:
  Robust Protocol for Generating Shared RSA Parameters. 280-289
  
• Stephan Wesemeyer, Peter Sweeney, David R. B. Burgess:
  Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes. 290-299
  
• Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith:
  Weaknesses in Shared RSA Key Generation Protocols. 300-306
  
• Chan Yeob Yeun:
  Digital Signature with Message Recovery and Authenticated Encryption (Signcryption) - A Comparison. 307-
  

Last update Sat May 25 03:38:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page