Designs, Codes and Cryptography, Volume 22, 2001

Volume 22, Number 1, January 2001

Ákos Seress: All Lambda-Designs With are Type-1. 5-17
Antonio Cossidente, Domenico Labbate, Alessandro Siciliano: Veronese Varieties Over Finite Fields and Their Projections. 19-32
Sylvie Dubuc: Characterization of Linear Structures. 33-45
Satoshi Obana, Kaoru Kurosawa: Bounds and Combinatorial Structure of Multi-Receiver-Codes. 47-63
Joan Daemen, Lars R. Knudsen, Vincent Rijmen: Linear Frameworks for Block Ciphers. 65-87
T. Aaron Gulliver, Masaaki Harada: Codes over and Improvements to the Bounds on Ternary Linear Codes. 89-96

Gretchen L. Matthews: Weierstrass Pairs and Minimum Distance of Goppa Codes. 107-121
Arne Winterhof: Some Estimates for Character Sums and Applications. 123-131
Douglas R. Stinson: Something About All or Nothing (Transforms). 133-138
Harold N. Ward: The Nonexistence of a [207, 4, 165] Code over GF(5). 139-148
Kenichiro Tanabe: A New Proof of the Assmus-Mattson Theorem for Non-Binary Codes. 149-155
Agnes V. Dizon-Garciano, Yutaka Hiramine: On Sylow Subgroups of Abelian Affine Difference Sets. 157-163
Tatsuya Maruta: On the Nonexistence of q-ary Linear Codes of Dimension Five. 165-177
Norman L. Johnson: Two-Transitive Parallelisms. 179-189
Ulrich Dempwolff: Primitive Rank 3 Groups on Symmetric Designs. 191-207

Michel Sebille: There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t. 215-219
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: On Perfect Codes and Related Concepts. 221-237
Renate Scheidler: Cryptography in Quadratic Function Fields. 239-264
Kaoru Kurosawa, Satoshi Obana: Combinatorial Bounds on Authentication Codes with Arbitration. 265-281
Vikram Jha, Norman L. Johnson: Almost Desarguesian Maximal Partial Spreads. 283-304
Alexander A. Davydov: New Constructions of Covering Codes. 305-316
Karl Brincat: On the Use of RSA as a Secret Key Cryptosystem. 317-329
Olof Heden: A Maximal Partial Spread of Size 45 in PG(3, 7). 331-334