Designs, Codes and Cryptography, Volume 51, 2009

Volume 51, Number 1, April 2009

• Tian Tian, Wen-Feng Qi:
  A note on the crosscorrelation of maximal length FCSR sequences. 1-8
  
• E. J. Cheon:
  A class of optimal linear codes of length one above the Griesmer bound. 9-20
  
• Yu. I. Lyubich:
  On tight projective designs. 21-31
  
• Wilfried Meidl:
  Remarks on a cyclotomic sequence. 33-43
  
• Krzysztof Petelczyc, Malgorzata Prazmowska:
  10₃-configurations and projective realizability of multiplied configurations. 45-54
  
• Steven T. Dougherty, Hongwei Liu:
  Independence of vectors in codes over rings. 55-68
  
• Sunghyu Han, Jon-Lark Kim:
  The nonexistence of near-extremal formally self-dual codes. 69-77
  
• R. Julian R. Abel, Norman J. Finizio, Malcolm Greig, Luis B. Morales: Existence of (2, 8) GWhD( v ) and (4, 8) GWhD( v ) with v . 0 , 1 (mod 8){v \equiv 0, 1 (mod 8)}. 79-97 http: //dx.doi.org/10.1007/s10623-008-9245-z
• Dimitrios Poulakis:
  A variant of Digital Signature Algorithm. 99-104
  

Volume 51, Number 2, May 2009

• Iliya Bouyukliev, Veerle Fack, Joost Winne:
  2-(31, 15, 7), 2-(35, 17, 8) and 2-(36, 15, 6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes. 105-122
  
• Antonio Cossidente:
  Some constructions on the Hermitian surface. 123-129
  
• Dieter Jungnickel, Vladimir D. Tonchev:
  Polarities, quasi-symmetric designs, and Hamada's conjecture. 131-140
  
• Ron Shaw, Neil A. Gordon:
  The cubic Segre variety in PG(5, 2). 141-156
  
• John Bamberg, Frank De Clerck, Nicola Durante:
  A hemisystem of a nonclassical generalised quadrangle. 157-165
  
• Michael J. Collins:
  Upper bounds for parent-identifying set systems. 167-173
  
• Tao Feng:
  Difference sets with n = 5 p ^r . 175-194
  
• Jooyoung Lee, Yongjin Yeom:
  Efficient RFID authentication protocols based on pseudorandom sequence generators. 195-210
  
• M. R. Darafsheh, A. Iranmanesh, R. Kahkeshani:
  Some designs and codes invariant under the groups S ₉ and A ₈. 211-223
  

Volume 51, Number 3, June 2009

• Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei:
  On orthogonal generalized equitable rectangles. 225-230
  
• Derek H. Smith, Richard P. Ward, Stephanie Perkins:
  Gold codes, Hadamard partitions and the security of CDMA systems. 231-243
  
• Sarah Spence Adams, Matthew Crawford, Caitlin Greeley, Bryce Lee, Mathav Kishore Murugan:
  Multilevel and multidimensional Hadamard matrices. 245-252
  
• Koji Momihara:
  Strong difference families, difference covers, and their applications for relative difference families. 253-273
  
• Silvia P. Boumova, Peter Boyvalenkov, Hristina Kulina, Maya Stoyanova:
  Polynomial techniques for investigation of spherical designs. 275-288
  
• José Joaquín Bernal, Ángel del Río, Juan Jacobo Simón:
  An intrinsical description of group codes. 289-300
  
• Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith:
  Finite field elements of high order arising from modular curves. 301-314
  
• Thomas Martin, Keith M. Martin, Peter R. Wild:
  Establishing the broadcast efficiency of the Subset Difference Revocation Scheme. 315-334