Table of contents for issues of Designs, Codes, and Cryptography

Last update: Wed Jul 9 12:40:02 MDT 2008                Valid HTML 3.2!

Volume 1, Number 1, May, 1991
Volume 1, Number 2, June, 1991
Volume 1, Number 3, September, 1991
Volume 1, Number 4, December, 1991
Volume 2, Number 1, March, 1992
Volume 2, Number 2, June, 1992
Volume 2, Number 3, September, 1992
Volume 2, Number 4, 1992
Volume 3, Number 1, March, 1993
Volume 3, Number 2, May, 1993
Volume 3, Number 3, 1993
Volume 3, Number 4, October, 1993
Volume 4, Number 1, January, 1994
Volume 4, Number 2, April, 1994
Volume 4, Number 3, 1994
Volume 4, Number 4, 1994
Volume 5, Number 1, January, 1995
Volume 5, Number 2, March, 1995
Volume 5, Number 3, May, 1995
Volume 6, Number 1, July, 1995
Volume 6, Number 2, September, 1995
Volume 6, Number 3, November, 1995
Volume 7, Number 1--2, January, 1996
Volume 7, Number 3, March, 1996
Volume 8, Number 1--2, May, 1996
Volume 8, Number 3, June, 1996
Volume 9, Number 1, August, 1996
Volume 9, Number 2, October, 1996
Volume 9, Number 3, November, 1996
Volume 10, Number 1, January, 1997
Volume 10, Number 2, February, 1997
Volume 10, Number 3, March, 1997
Volume 11, Number 1, April, 1997
Volume 11, Number 2, May, 1997
Volume 11, Number 3, July, 1997
Volume 12, Number 1, September, 1997
Volume 12, Number 2, October, 1997
Volume 12, Number 3, November, 1997
Volume 13, Number 1, January, 1998
Volume 13, Number 2, February, 1998
Volume 13, Number 3, March, 1998
Volume 14, Number 1, April, 1998
Volume 14, Number 2, May, 1998
Volume 14, Number 3, September, 1998
Volume 15, Number 1, October, 1998
Volume 15, Number 2, 1998
Volume 15, Number 3, December, 1998
Volume 16, Number 1, January, 1999
Volume 16, Number 2, February, 1999
Volume 16, Number 3, May, 1999
Volume 17, Number 1--3, September, 1999
Volume 18, Number 1--3, December, 1999
Volume 19, Number 1, January, 2000
Volume 19, Number 2--3, March, 2000
Volume 20, Number 1, April, 2000
Volume 20, Number 2, June, 2000
Volume 20, Number 3, July, 2000
Volume 21, Number 1--3, October, 2000
Volume 22, Number 1, January, 2001
Volume 22, Number 2, March, 2001
Volume 22, Number 3, January, 2001
Volume 23, Number 1, May, 2001
Volume 23, Number 2, July, 2001
Volume 23, Number 3, August, 2001
Volume 24, Number 1, September, 2001
Volume 24, Number 2, October, 2001
Volume 24, Number 3, December, 2001
Volume 25, Number 1, January, 2002
Volume 25, Number 2, February, 2002
Volume 25, Number 3, March, 2002
Volume 26, Number 1--3, June / July / August, 2002
Volume 27, Number 1--2, October / November, 2002
Volume 27, Number 3, December, 2002
Volume 28, Number 1, January, 2003
Volume 28, Number 2, March, 2003
Volume 28, Number 3, April, 2003
Volume 29, Number 1--3, May / June / July, 2003
Volume 30, Number 1, August, 2003
Volume 30, Number 2, September, 2003
Volume 30, Number 3, November, 2003
Volume 31, Number 1, January, 2004
Volume 31, Number 2, February, 2004
Volume 31, Number 3, March, 2004
Volume 32, Number 1--3, May / July, 2004
Volume 33, Number 1, August, 2004
Volume 33, Number 2, September, 2004
Volume 33, Number 3, November, 2004
Volume 34, Number 1, January, 2005
Volume 34, Number 2--3, February, 2005
Volume 35, Number 1, April, 2005
Volume 35, Number 2, May, 2005
Volume 35, Number 3, June, 2005
Volume 36, Number 1, July, 2005
Volume 36, Number 2, August, 2005
Volume 36, Number 3, September, 2005
Volume 37, Number 1, October, 2005
Volume 37, Number 2, November, 2005
Volume 37, Number 3, December, 2005
Volume 38, Number 1, January, 2006
Volume 38, Number 2, February, 2006
Volume 38, Number 3, March, 2006
Volume 39, Number 1, April, 2006
Volume 39, Number 2, May, 2006
Volume 39, Number 3, June, 2006
Volume 40, Number 1, July, 2006
Volume 40, Number 2, August, 2006
Volume 40, Number 3, September, 2006
Volume 41, Number 1, October, 2006
Volume 41, Number 2, November, 2006
Volume 41, Number 3, December, 2006
Volume 42, Number 1, January, 2007
Volume 42, Number 2, February, 2007
Volume 42, Number 3, March, 2007
Volume 43, Number 1, April, 2007
Volume 43, Number 2--3, June, 2007
Volume 44, Number 1--3, September, 2007
Volume 45, Number 1, October, 2007
Volume 45, Number 2, November, 2007
Volume 45, Number 3, December, 2007
Volume 46, Number 1, January, 2008
Volume 46, Number 2, February, 2008
Volume 46, Number 3, March, 2008
Volume 47, Number 1--3, June, 2008
Volume 48, Number 1, July, 2008
Volume 48, Number 2, August, 2008
Volume 48, Number 3, September, 2008


Designs, Codes, and Cryptography
Volume 1, Number 1, May, 1991

                      Anonymous   Editorial  . . . . . . . . . . . . . . . 5
              G. Eric Moorhouse   Bruck nets, codes, and characters of
                                  loops  . . . . . . . . . . . . . . . . . 7--29
       A. Tietäväinen   Covering radius and dual distance  . . . 31--46
            B. A. LaMacchia and   
                  A. M. Odlyzko   Computation of discrete logarithms in
                                  prime fields . . . . . . . . . . . . . . 47--62
               E. R. Lamken and   
                W. H. Mills and   
                   R. M. Wilson   Four pairwise balanced designs . . . . . 63--68
                    Chat Yin Ho   Some remarks on orders of projective
                                  planes, planar difference sets and
                                  multipliers  . . . . . . . . . . . . . . 69--75
            Juriaan Simonis and   
             Cornelis de Vroedt   A simple proof of the Delsarte
                                  inequalities . . . . . . . . . . . . . . 77--82
                K. T. Arasu and   
                 Alexander Pott   On quasiregular collineation groups of
                                  projective planes  . . . . . . . . . . . 83--92

Designs, Codes, and Cryptography
Volume 1, Number 2, June, 1991

                   Klaus Metsch   Improvement of Bruck's completion
                                  theorem  . . . . . . . . . . . . . . . . 99--116
                 James A. Davis   A note on products of relative
                                  difference sets  . . . . . . . . . . . . 117--119
                  Helmut Siemon   Cyclic Steiner quadruple systems and
                                  Köhler's orbit graphs . . . . . . . . . . 121--132
              David J. Peterson   Fractal properties of the singular
                                  function $s(u)$  . . . . . . . . . . . . 133--139
     Jürgen Bierbrauer and   
                 Tran Van Trung   Halving ${\rm PGL}(2,2^f), f$ odd: a
                                  series of cryptocodes  . . . . . . . . . 141--148
             B. A. Anderson and   
                  P. A. Leonard   A class of self-orthogonal
                                  $2$-sequencings  . . . . . . . . . . . . 149--181
             Douglas A. Leonard   Linear cyclic codes of wordlength $v$
                                  over ${\rm GF}(q^s)$ which are also
                                  linear cyclic codes of wordlength $sv$
                                  over ${\rm GF}(q)$ . . . . . . . . . . . 183--189

Designs, Codes, and Cryptography
Volume 1, Number 3, September, 1991

                A. A. Bruen and   
                   J. C. Fisher   The Jamison method in Galois geometries  199--205
                   Oliver Pfaff   The classification of doubly transitive
                                  affine designs . . . . . . . . . . . . . 207--217
              Dirk Hachenberger   Constructions of large translation nets
                                  with nonabelian translation groups . . . 219--236
              Anne Delandtsheer   Dimensional linear spaces whose
                                  automorphism group is (line,
                                  hyperplane)-flag transitive  . . . . . . 237--245
              D. Jungnickel and   
            Vladimir D. Tonchev   Exponential number of quasi-symmetric
                                  SDP designs and codes meeting the
                                  Grey-Rankin bound  . . . . . . . . . . . 247--253
                      J. D. Key   Hermitian varieties as codewords . . . . 255--259
                  E. W. Lambeck   A remark on the intersection arrays of
                                  distance regular graphs and the distance
                                  regular graphs of diameter $d=3i-1$ with
                                  $b_i=1$ and $k>2$ . . . . . . . . . . . . 261--266

Designs, Codes, and Cryptography
Volume 1, Number 4, December, 1991

                 Antonio Pasini   Diagram geometries for sharply
                                  $n$-transitive sets of permutations or
                                  of mappings  . . . . . . . . . . . . . . 275--297
           H. Van Maldeghem and   
                 J. A. Thas and   
                    S. E. Payne   Desarguesian finite generalized
                                  quadrangles are classical or dual
                                  classical  . . . . . . . . . . . . . . . 299--305
     Jürgen Bierbrauer and   
                 Tran Van Trung   Some highly symmetric authentication
                                  perpendicular arrays . . . . . . . . . . 307--319
                       S. L. Ma   McFarland's conjecture on abelian
                                  difference sets with multiplier $-1$ . . 321--332
               Ka Hin Leung and   
                 Siu Lun Ma and   
                   Yan Loi Wong   Difference sets in dihedral groups . . . 333--338


Designs, Codes, and Cryptography
Volume 2, Number 1, March, 1992

           Tomik Yaghoobian and   
                   Ian F. Blake   Hermitian codes as generalized
                                  Reed-Solomon codes . . . . . . . . . . . 5--17
                Jonathan Jedwab   Generalized perfect arrays and Menon
                                  difference sets  . . . . . . . . . . . . 19--68
                 Bhaskar Bagchi   On quasi-symmetric designs . . . . . . . 69--79
            P. P. Greenough and   
                        R. Hill   Optimal ternary quasi-cyclic codes . . . 81--91
            Jonathan Jedwab and   
                 Sheelagh Lloyd   A note on the nonexistence of Barker
                                  sequences  . . . . . . . . . . . . . . . 93--97

Designs, Codes, and Cryptography
Volume 2, Number 2, June, 1992

           Whitfield Diffie and   
       Paul C. van Oorschot and   
              Michael J. Wiener   Authentication and authenticated key
                                  exchanges  . . . . . . . . . . . . . . . 107--125
                  Edward Spence   A complete classification of symmetric
                                  $(31,10,3)$ designs  . . . . . . . . . . 127--136
                    R. Hill and   
                   D. E. Newton   Optimal ternary linear codes . . . . . . 137--157
               Darryn E. Bryant   Varieties of quasigroups arising from
                                  $2$-perfect $m$-cycle systems  . . . . . 159--168
               Stephen D. Cohen   The explicit construction of irreducible
                                  polynomials over finite fields . . . . . 169--174
                  D. R. Stinson   Combinatorial characterizations of
                                  authentication codes . . . . . . . . . . 175--187
                A. Blokhuis and   
               A. R. Calderbank   Quasi-symmetric designs and the Smith
                                  normal form  . . . . . . . . . . . . . . 189--206

Designs, Codes, and Cryptography
Volume 2, Number 3, September, 1992

                 Xiang Dong Hou   Some inequalities about the covering
                                  radius of Reed--Muller codes . . . . . . 215--224
              Noboru Hamada and   
              Tor Helleseth and   
          Òyvind Ytrehus   On the construction of
                                  $[q^4+q^2-q,5,q^4-q^3+q^2-2q;q]$-codes
                                  meeting the Griesmer bound . . . . . . . 225--229
         Michael R. Fellows and   
                   Neal Koblitz   Self-witnessing polynomial-time
                                  complexity and prime factorization . . . 231--235
        Charles J. Colbourn and   
            Eric Mendelsohn and   
          Cheryl E. Praeger and   
            Vladimir D. Tonchev   Concerning multiplier automorphisms of
                                  cyclic Steiner triple systems  . . . . . 237--251
                    Ronald Shaw   A characterization of the primals in
                                  ${\rm PG}(m,2)$  . . . . . . . . . . . . 253--256
                K. T. Arasu and   
                     Qing Xiang   On the existence of periodic
                                  complementary binary sequences . . . . . 257--262
                 Alexander Pott   On abelian difference set codes  . . . . 263--271
             Peter Landrock and   
                      Olaf Manz   Classical codes as ideals in group
                                  algebras . . . . . . . . . . . . . . . . 273--285
                Thomas Beth and   
                    Volker Hatz   Design machines: algebraically well
                                  described interconnection networks . . . 287--298

Designs, Codes, and Cryptography
Volume 2, Number 4, 1992

              Nicola Melone and   
                        Udo Ott   On the rank of truncated incidence
                                  matrices of linear spaces  . . . . . . . 307--313
                Shuhong Gao and   
        Hendrik W. Lenstra, Jr.   Optimal normal bases . . . . . . . . . . 315--323
              W.-A. Jackson and   
                     P. R. Wild   Relations between two perfect ternary
                                  sequence constructions . . . . . . . . . 325--332
                   Zhe Xian Wan   Construction of Cartesian authentication
                                  codes from unitary geometry  . . . . . . 333--356
                  D. R. Stinson   An explication of secret sharing schemes 357--390
                 D. de Caen and   
               C. D. Godsil and   
                    G. F. Royle   On the $p$-rank of incidence matrices
                                  and a bound of Bruen and Ott . . . . . . 391--394
               Bernhard Schmidt   Note on a question by S. Bagchi and B.
                                  Bagchi: ``Designs from pairs of finite
                                  fields. I. A cyclic unital $U(6)$ and
                                  other regular Steiner $2$-designs'' [J.
                                  Combin. Theory Ser. A 52 (1989), no. 1,
                                  51--61; MR 90k:05025]  . . . . . . . . . 395--395


Designs, Codes, and Cryptography
Volume 3, Number 1, March, 1993

            Donovan R. Hare and   
                William McCuaig   The connectivity of the
                                  block-intersection graphs of designs . . 5--8
               W. D. Wallis and   
                J. L. Yucas and   
                    G.-H. Zhang   Single change covering designs . . . . . 9--19
                Charles Laywine   Subsquares in orthogonal Latin squares
                                  as subspaces in affine geometries: a
                                  generalization of an equivalence of Bose 21--28
           Levon H. Khachatrian   The lower bound of the quadratic spans
                                  of de Bruijn sequences . . . . . . . . . 29--32
                   E. R. Lamken   Existence results for generalized
                                  balanced tournament designs with block
                                  size $3$ . . . . . . . . . . . . . . . . 33--61
               Chris M. Skinner   Nonsymmetric $2$-designs modulo $2$  . . 63--68
              Peter Boyvalenkov   Nonexistence of certain symmetric
                                  spherical codes  . . . . . . . . . . . . 69--74
               W. de Launey and   
                  K. J. Horadam   A weak difference set construction for
                                  higher-dimensional designs . . . . . . . 75--87

Designs, Codes, and Cryptography
Volume 3, Number 2, May, 1993

              A. E. Brouwer and   
          L. M. G. M. Tolhuizen   A sharpening of the Johnson bound for
                                  binary linear codes and the nonexistence
                                  of linear codes with Preparata
                                  parameters . . . . . . . . . . . . . . . 95--98
               V. C. Mavron and   
                   W. D. Wallis   Cubic arcs in cubic nets . . . . . . . . 99--104
                 Alexander Barg   Incomplete sums, dc-constrained codes,
                                  and codes that maintain synchronization  105--116
                  J. D. Key and   
                 F. E. Sullivan   Codes of Steiner triple and quadruple
                                  systems  . . . . . . . . . . . . . . . . 117--125
     Albrecht Beutelspacher and   
                   Ferenc Wettl   On $2$-level secret sharing  . . . . . . 127--134
                  Claude Carlet   Partially-bent functions . . . . . . . . 135--145
                     W. K. Chan   Necessary conditions for Menon
                                  difference sets  . . . . . . . . . . . . 147--154
                 S. S. Sane and   
               M. S. Shrikhande   Some characterizations of
                                  quasi-symmetric designs with a spread    155--166
                 Xiang Dong Hou   Further results on the covering radii of
                                  the Reed--Muller codes . . . . . . . . . 167--177

Designs, Codes, and Cryptography
Volume 3, Number 3, 1993

              Aart Blokhuis and   
                   Klaus Metsch   On the size of a maximal partial spread  187--191
               Edwin R. van Dam   Classification of spreads of ${\rm
                                  PG}(3,4)\sbs{\rm PG}(3,2)$ . . . . . . . 193--198
                    Thomas Beth   The ${\rm GF}(p)$-dimension of the codes
                                  generated by the classical point-line
                                  geometries over ${\rm GF}(p)$  . . . . . 199--207
        Charles J. Colbourn and   
             Alexander Rosa and   
           \vStefan Znám   The spectrum of maximal partial Steiner
                                  triple systems . . . . . . . . . . . . . 209--219
              Josep Rif\`a-Coma   How to avoid the cheaters succeeding in
                                  the key sharing scheme . . . . . . . . . 221--228
       Christine M. O'Keefe and   
                   Alan Rahilly   Spreads and group divisible designs  . . 229--235
                  Claude Carlet   The automorphism groups of the
                                  Delsarte-Goethals codes  . . . . . . . . 237--249
Heikki O. Hämäläinen and   
            Iiro S. Honkala and   
        Markku K. Kaikkonen and   
                Simon N. Litsyn   Bounds for binary multiple covering
                                  codes  . . . . . . . . . . . . . . . . . 251--275

Designs, Codes, and Cryptography
Volume 3, Number 4, October, 1993

                 Sara Bitan and   
                    Tuvi Etzion   The last packing number of quadruples,
                                  and cyclic SQS . . . . . . . . . . . . . 283--313
               Steven Dougherty   Nets and their codes . . . . . . . . . . 315--331
           Willi Geiselmann and   
                Dieter Gollmann   Self-dual bases in ${\bf F}_{q^n}$ . . . 333--345
                     A. Klapper   Cross-correlations of geometric
                                  sequences in characteristic two  . . . . 347--377
             James A. Davis and   
                Jonathan Jedwab   A note on new semi-regular divisible
                                  difference sets  . . . . . . . . . . . . 379--381


Designs, Codes, and Cryptography
Volume 4, Number 1, January, 1994

                  Luc Teirlinck   Some new $2$-resolvable Steiner
                                  quadruple systems  . . . . . . . . . . . 5--10
          Chris J. Mitchell and   
            Kenneth G. Paterson   Decoding perfect maps  . . . . . . . . . 11--30
               J. H. Conway and   
                N. J. A. Sloane   Quaternary constructions for the binary
                                  single-error-correcting codes of Julin,
                                  Best and others  . . . . . . . . . . . . 31--42
          George T. Kennedy and   
                     Vera Pless   On designs and formally self-dual codes  43--55
        Stefan M. Dodunekov and   
          Silvia B. Encheva and   
             Stoyan N. Kapralov   On the $[28, 7, 12]$ binary
                                  self-complementary codes and their
                                  residuals  . . . . . . . . . . . . . . . 57--67
               Thomas Johansson   A shift register construction of
                                  unconditionally secure authentication
                                  codes  . . . . . . . . . . . . . . . . . 69--81
             Wen-Ai Jackson and   
                Keith M. Martin   Geometric secret sharing schemes and
                                  their duals  . . . . . . . . . . . . . . 83--95

Designs, Codes, and Cryptography
Volume 4, Number 2, April, 1994

                   U. Dempwolff   Translation planes of order $27$ . . . . 105--121
            Steven T. Dougherty   A coding-theoretic solution to the $36$
                                  officer problem  . . . . . . . . . . . . 123--128
              Dirk Hachenberger   On completely free elements in finite
                                  fields . . . . . . . . . . . . . . . . . 129--143
            Roberta Evans Sabin   On row-cyclic codes with algebraic
                                  structure  . . . . . . . . . . . . . . . 145--155
                    Attila Sali   On the rigidity of spherical $t$-designs
                                  that are orbits of finite reflection
                                  groups . . . . . . . . . . . . . . . . . 157--170
 Gérald E. Séguin   A counter-example to a recent result on
                                  the $q$-ary image of a $q^s$-ary cyclic
                                  code . . . . . . . . . . . . . . . . . . 171--175
           Kathleen A. S. Quinn   Some constructions for key distribution
                                  patterns . . . . . . . . . . . . . . . . 177--191
                 Alfred Menezes   Book review  . . . . . . . . . . . . . . 193

Designs, Codes, and Cryptography
Volume 4, Number 3, 1994

           A. R. Calderbank and   
                 P. C. Fishburn   Maximal three-independent subsets of
                                  $\{0,1,2\}^n$  . . . . . . . . . . . . . 203--211
                     Olof Heden   A binary perfect code of length $15$ and
                                  codimension $0$  . . . . . . . . . . . . 213--220
                       S. L. Ma   A survey of partial difference sets  . . 221--261
               M. J. B. Robshaw   On evaluating the linear complexity of a
                                  sequence of least period $2^n$ . . . . . 263--269
               M. van Eupen and   
                        R. Hill   An optimal ternary $[69,5,45]$ code and
                                  related codes  . . . . . . . . . . . . . 271--282
                   Zhe Xian Wan   The weight hierarchies of the projective
                                  codes from nondegenerate quadrics  . . . 283--300

Designs, Codes, and Cryptography
Volume 4, Number 4, 1994

                R. D. Baker and   
                    G. L. Ebert   A Bruen chain for $q=19$ . . . . . . . . 307--312
               Yu Qing Chen and   
                 Qing Xiang and   
             Surinder K. Sehgal   An exponent bound on skew Hadamard
                                  abelian difference sets  . . . . . . . . 313--317
          Dieter Jungnickel and   
                 Alexander Pott   A new class of symmetric
                                  $(v,k,\lambda)$-designs  . . . . . . . . 319--325
             C. Koukouvinos and   
                 S. Kounias and   
                 J. Seberry and   
                 C. H. Yang and   
                        J. Yang   On sequences with zero autocorrelation   327--340
              Chris J. Mitchell   Constructing $c$-ary perfect factors . . 341--368
                  D. R. Stinson   Universal hashing and authentication
                                  codes  . . . . . . . . . . . . . . . . . 369--380
            Gilles Zémor   Hash functions and Cayley graphs . . . . 381--394


Designs, Codes, and Cryptography
Volume 5, Number 1, January, 1995

                K. T. Arasu and   
             Surinder K. Sehgal   Difference Sets in Abelian Groups of
                                  $p$-Rank Two . . . . . . . . . . . . . . 5--12
                  Marco Buratti   A Powerful Method for Constructing
                                  Difference Families and Optimal Optical
                                  Orthogonal Codes . . . . . . . . . . . . 13--25
               M. J. Coster and   
                  W. H. Haemers   Quasi-Symmetric Designs Related to the
                                  Triangular Graph . . . . . . . . . . . . 27--42
                Clement Lam and   
                Larry Thiel and   
            Vladimir D. Tonchev   On quasi-symmetric $2$-$(28,12,11)$ and
                                  $2$-$(36,16,12)$ designs . . . . . . . . 43--55
              Rudolf Mathon and   
                Gordon F. Royle   The Translation Planes of Order $49$ . . 57--72
             David Naccache and   
           David M?Ra\"\ihi and   
                   Dan Raphaeli   Can Montgomery Parasites Be Avoided? A
                                  Design Methodology Based on Key and
                                  Cryptosystem Modifications . . . . . . . 73--80
                   U. Dempwolff   Correction to: ``Translation planes of
                                  order $27$'' [Des. Codes Cryptogr. 4
                                  (1994), no. 2, 105--121; MR 95a:51012]   81--81

Designs, Codes, and Cryptography
Volume 5, Number 2, March, 1995

                 Ahmed M. Assaf   On Covering Designs with Block Size $5$
                                  and Index $5$  . . . . . . . . . . . . . 91--107
              David Gillman and   
               Ronald L. Rivest   Complete Variable-Length ``Fix-Free''
                                  Codes  . . . . . . . . . . . . . . . . . 109--114
            Kenneth G. Paterson   Perfect Factors in the de Bruijn Graph   115--138
            René Peeters   On the $p$-Ranks of Net Graphs . . . . . 139--153
            Stephan J. Suchower   Nonisomorphic Complete Sets of
                                  $F$-Rectangles with Prime Power
                                  Dimensions . . . . . . . . . . . . . . . 155--174

Designs, Codes, and Cryptography
Volume 5, Number 3, May, 1995

              Marco Carpentieri   A Perfect Threshold Secret Sharing
                                  Scheme to Identify Cheaters  . . . . . . 183--187
        Charles J. Colbourn and   
          Jeffrey H. Dinitz and   
             Mieczys\law Wojtas   Thwarts in Transversal Designs . . . . . 189--197
                     R. Craigen   The Structure of Weighing Matrices
                                  having Large Weights . . . . . . . . . . 199--216
                Tuvi Etzion and   
                 Victor Wei and   
                     Zhen Zhang   Bounds on the Sizes of Constant Weight
                                  Covering Codes . . . . . . . . . . . . . 217--239
          K. Gopalakrishnan and   
                  D. R. Stinson   Three Characterizations of Non-binary
                                  Correlation-Immune and Resilient
                                  Functions  . . . . . . . . . . . . . . . 241--251
               Akihiro Munemasa   On Perfect $t$-Shift Codes in Abelian
                                  Groups . . . . . . . . . . . . . . . . . 253--259
           Christine M. O'Keefe   Key Distribution Patterns using
                                  Minkowski Planes . . . . . . . . . . . . 261--267
                 Tran Van Trung   On the Construction of Authentication
                                  and Secrecy Codes  . . . . . . . . . . . 269--280
                  J. D. Key and   
                 F. E. Sullivan   Erratum: ``Codes of Steiner triple and
                                  quadruple systems'' [Des. Codes
                                  Cryptogr. \bf 3 (1993), no. 2, 117--125;
                                  MR 94e:05050]  . . . . . . . . . . . . . 281--281


Designs, Codes, and Cryptography
Volume 6, Number 1, July, 1995

            Patrick A. H. Bours   On the Construction of Perfect
                                  Deletion-Correcting Codes using Design
                                  Theory . . . . . . . . . . . . . . . . . 5--20
           A. R. Calderbank and   
                N. J. A. Sloane   Modular and $p$-adic Cyclic Codes  . . . 21--35
                   J. K. Gibson   Severely Denting the Gabidulin Version
                                  of the McEliece Public Key Cryptosystem  37--45
             Glenn Hurlbert and   
                    Garth Isaak   New Constructions for de Bruijn Tori . . 47--56
                   S. L. Ma and   
               Bernhard Schmidt   On $(p^a,p,p^a,p^{a-1})$-relative
                                  difference sets  . . . . . . . . . . . . 57--71
               W. J. Martin and   
                      X. J. Zhu   Anticodes for the Grassman and bilinear
                                  forms graphs . . . . . . . . . . . . . . 73--79

Designs, Codes, and Cryptography
Volume 6, Number 2, September, 1995

             Masaaki Harada and   
                 Hiroshi Kimura   New Extremal Doubly-Even $[64, 32, 12]$
                                  Codes  . . . . . . . . . . . . . . . . . 91--96
            W. Cary Huffman and   
            Vladimir D. Tonchev   The existence of extremal self-dual
                                  $[50,25,10]$ codes and quasi-symmetric
                                  $2$-$(49,9,6)$ designs . . . . . . . . . 97--106
                    Helmut Meyn   Explicit $N$-Polynomials of $2$-Power
                                  Degree over Finite Fields, I . . . . . . 107--116
           Renate Scheidler and   
               Hugh C. Williams   A Public-Key Cryptosystem Utilizing
                                  Cyclotomic Fields  . . . . . . . . . . . 117--131
                 N. Shalaby and   
                         J. Yin   Directed packings with block size $5$
                                  and even $\nu$ . . . . . . . . . . . . . 133--142
                Marten Van Dijk   On the Information Rate of Perfect
                                  Secret Sharing Schemes . . . . . . . . . 143--169

Designs, Codes, and Cryptography
Volume 6, Number 3, November, 1995

                     P. Dey and   
                   J. L. Hayden   On Symmetric Incidence Matrices of
                                  Projective Planes  . . . . . . . . . . . 179--188
                D. G. Glynn and   
            J. W. P. Hirschfeld   On the Classification of Geometric Codes
                                  by Polynomial Functions  . . . . . . . . 189--204
               Thomas Johansson   Authentication Codes for Nontrusting
                                  Parties Obtained from Rank Metric Codes  205--218
                Yaron Klein and   
               Simon Litsyn and   
                Alexander Vardy   Two New Bounds on the Size of Binary
                                  Codes with a Minimum Distance of Three   219--227
               Tim Penttila and   
                Gordon F. Royle   Sets of Type $(m, n)$ in the Affine and
                                  Projective Planes of Order Nine  . . . . 229--245
            Kevin T. Phelps and   
                     Mike Levan   Kernels of Nonlinear Hamming Codes . . . 247--257


Designs, Codes, and Cryptography
Volume 7, Number 1--2, January, 1996

                      Anonymous   Foreword to this issue . . . . . . . . . 7--8
               Whitfield Diffie   The National Security Establishment and
                                  the Development of Public-Key
                                  Cryptography . . . . . . . . . . . . . . 9--12
                   Mary Fischer   ``And Now For Something Completely
                                  Different'' (The Egyptologist and the
                                  Cryptographer: A Personal Reminiscence)  13--15
                    Thomas Beth   Watching the Bhang Meter and Flying
                                  through Dirt . . . . . . . . . . . . . . 17--25
              Paul Syverson and   
              Catherine Meadows   A Formal Language for Cryptographic
                                  Protocol Requirements  . . . . . . . . . 27--59
               Kaisa Nyberg and   
              Rainer A. Rueppel   Message Recovery for Signature Schemes
                                  Based on the Discrete Logarithm Problem  61--81
            R. Safavi-Naini and   
                      L. Tombak   Authentication Codes in Plaintext and
                                  Chosen-Content Attacks . . . . . . . . . 83--99
             C. J. Mitchell and   
                F. C. Piper and   
                  M. Walker and   
                        P. Wild   Authentication Schemes, Perfect Local
                                  Randomizers, Perfect Secrecy and Secret
                                  Sharing Schemes  . . . . . . . . . . . . 101--110
              Xian-Mo Zhang and   
                  Yuliang Zheng   Characterizing the Structures of
                                  Cryptographic Functions Satisfying the
                                  Propagation Criterion for Almost All
                                  Vectors  . . . . . . . . . . . . . . . . 111--134
            Dieter Gollmann and   
                Yongfei Han and   
              Chris J. Mitchell   Redundant Integer Representations and
                                  Fast Exponentiation  . . . . . . . . . . 135--151
               R. Scheidler and   
                   A. Stein and   
               Hugh C. Williams   Key-Exchange in Real Quadratic
                                  Congruence Function Fields . . . . . . . 153--174
                  J. D. Key and   
                 F. E. Sullivan   Correction to: ``Codes of Steiner triple
                                  and quadruple systems'' [Des. Codes
                                  Cryptogr. \bf 3 (1993), no. 2, 117--125;
                                  MR 94e:05050]  . . . . . . . . . . . . . 175--175

Designs, Codes, and Cryptography
Volume 7, Number 3, March, 1996

        Alexey E. Ashikhmin and   
                Simon N. Litsyn   Fast Decoding Algorithms for First Order
                                  Reed--Muller and Related Codes . . . . . 187--214
              Thierry P. Berger   On the Automorphism Groups of
                                  Affine-Invariant Codes . . . . . . . . . 215--221
          T. Aaron Gulliver and   
              Vijay K. Bhargava   New Good Rate $(m-1)/pm$ Ternary and
                                  Quaternary Quasi-Cyclic Codes  . . . . . 223--233
           Marijn Van Eupen and   
              Noboru Hamada and   
                  Yoko Watamori   The Nonexistence of Ternary $[50,5,32]$
                                  Codes  . . . . . . . . . . . . . . . . . 235--237
               Rolf S. Rees and   
             Douglas R. Stinson   Combinatorial characterizations of
                                  authentication codes. II . . . . . . . . 239--259


Designs, Codes, and Cryptography
Volume 8, Number 1--2, May, 1996

          Dieter Jungnickel and   
            Günter Pickert   A Life's Work in Geometry: An Homage to
                                  Hanfried Lenz  . . . . . . . . . . . . . 9--22
                K. T. Arasu and   
                 Alexander Pott   Impossibility of a Certain Cyclotomic
                                  Equation with Applications to Difference
                                  Sets . . . . . . . . . . . . . . . . . . 23--27
         Alphonse Baartmans and   
               Ivan Landjev and   
            Vladimir D. Tonchev   On the Binary Codes of Steiner Triple
                                  Systems  . . . . . . . . . . . . . . . . 29--43
                   R. A. Bailey   Orthogonal Partitions in Designed
                                  Experiments  . . . . . . . . . . . . . . 45--77
                R. D. Baker and   
                    G. L. Ebert   Regulus-free spreads of ${\rm PG}(3, q)$ 79--89
                    Thomas Beth   Designs, Codes and Crypts --- A Puzzle
                                  Altogether . . . . . . . . . . . . . . . 91--101
           Darryn E. Bryant and   
              D. G. Hoffman and   
                   C. A. Rodger   $5$-Cycle Systems with Holes . . . . . . 103--108
               Peter J. Cameron   Stories about Groups and Sequences . . . 109--133
              Dirk Hachenberger   Groups Admitting a Kantor Family and a
                                  Factorized Normal Subgroup . . . . . . . 135--143
          Willem H. Haemers and   
            Vladimir D. Tonchev   Spreads in Strongly Regular Graphs . . . 145--157
          Dieter Jungnickel and   
   Marialuisa J. de Resmini and   
              Scott A. Vanstone   Codes Based on Complete Graphs . . . . . 159--165
               Ka Hin Leung and   
                     Siu Lun Ma   A construction of partial difference
                                  sets in $Z_{p^2}\times
                                  Z_{p^2}\times\cdots\times Z_{p^2}$ . . . 167--172
         Arlene A. Pascasio and   
          Cheryl E. Praeger and   
            Blessilda P. Raposa   On the characterisation of ${\rm
                                  AG}(n,q)$ by its parameters as a nearly
                                  triply regular design  . . . . . . . . . 173--179
                    S. E. Payne   The fundamental theorem of $q$-clan
                                  geometry . . . . . . . . . . . . . . . . 181--202
            Günter Pickert   Extension of Gravity Centers
                                  Configuration to Steiner Triple Systems  203--214
        D. K. Ray-Chaudhuri and   
                     Qing Xiang   Constructions of Partial Difference Sets
                                  and Relative Difference Sets Using
                                  Galois Rings . . . . . . . . . . . . . . 215--227
                E. E. Shult and   
                     J. A. Thas   $m$-systems and partial $m$-systems of
                                  polar spaces . . . . . . . . . . . . . . 229--238
                  Helmut Siemon   Piotrowski's Infinite Series of Steiner
                                  Quadruple Systems Revisited  . . . . . . 239--254

Designs, Codes, and Cryptography
Volume 8, Number 3, June, 1996

                   R. A. Bailey   Orthogonal partitions in designed
                                  experiments. Corrected reprint . . . . . 45--77
               Peter J. Cameron   Stories about groups and sequences.
                                  Corrected reprint of ``Stories about
                                  groups and sequences'' [Des. Codes
                                  Cryptogr. \bf 8 (1996), no. 1--2,
                                  109--133; MR 97f:20004a] . . . . . . . . 109--133
           Josep Domingo-Ferrer   Achieving Rights Untransferability with
                                  Client-Independent Servers . . . . . . . 263--271
                 Masaaki Harada   Existence of New Extremal Doubly-Even
                                  Codes and Extremal Singly-Even Codes . . 273--283
                 Xiang-dong Hou   The Covering Radius of $R(1,9)$ in
                                  $R(4,9)$ . . . . . . . . . . . . . . . . 285--292
             Heeralal Janwa and   
                   Oscar Moreno   McEliece Public Key Cryptosystems Using
                                  Algebraic-Geometric Codes  . . . . . . . 293--307
                Ivan N. Landgev   Constructions of Group Divisible Designs 309--318
                  D. B. Meisner   New Classes of Groups Containing Menon
                                  Difference Sets  . . . . . . . . . . . . 319--325
       Tamás Szönyi   On Cyclic Caps in Projective Spaces  . . 327--332


Designs, Codes, and Cryptography
Volume 9, Number 1, August, 1996

               Vladimir Tonchev   Preface  . . . . . . . . . . . . . . . . 5--6
          E. F. Assmus, Jr. and   
                      J. D. Key   Designs and codes: An update . . . . . . 7--27
     Jürgen Bierbrauer and   
              Stephen Black and   
                      Yves Edel   Some $t$-homogeneous sets of
                                  permutations . . . . . . . . . . . . . . 29--38
                Jeffrey T. Bonn   Forcing Linearity on Greedy Codes  . . . 39--49
            Laurel L. Carpenter   Oval Designs in Desarguesian Projective
                                  Planes . . . . . . . . . . . . . . . . . 51--59
        Charles J. Colbourn and   
               Donald L. Kreher   Concerning Difference Matrices . . . . . 61--70
                 Hiroshi Kimura   Hadamard Matrices and Dihedral Groups    71--77
                   Laura Monroe   Self-Orthogonal Greedy Codes . . . . . . 79--83
                  Iosif Pinelis   On the Minimal Number of Even
                                  Submatrices of $0$-$1$ Matrices  . . . . 85--93
                     J. A. Thas   $k$-arcs, hyperovals, partial flocks and
                                  flocks . . . . . . . . . . . . . . . . . 95--104
                 Tran Van Trung   A Generalization of a Theorem of Dehon
                                  for Simple $t$-Designs . . . . . . . . . 105--114
                 Judy L. Walker   A New Approach to the Main Conjecture on
                                  Algebraic-Geometric MDS Codes  . . . . . 115--120

Designs, Codes, and Cryptography
Volume 9, Number 2, October, 1996

          Stefka Buyuklieva and   
                  Vassil Yorgov   Singly-Even Self-Dual Codes of Length
                                  $40$ . . . . . . . . . . . . . . . . . . 131--141
               Mario A. de Boer   Almost MDS Codes . . . . . . . . . . . . 143--155
            Chang-Seop Park and   
             Gui-Liang Feng and   
               Kenneth K. Tzeng   The New Minimum Distance Bounds of Goppa
                                  Codes and Their Decoding . . . . . . . . 157--176
                    Ron M. Roth   Spectral-Null Codes and Null Spaces of
                                  Hadamard Submatrices . . . . . . . . . . 177--191
              Alfred Scheerhorn   Dickson Polynomials, Completely Normal
                                  Polynomials and the Cyclic Module
                                  Structure of Specific Extensions of
                                  Finite Fields  . . . . . . . . . . . . . 193--202
              M. A. Shokrollahi   Stickelberger Codes  . . . . . . . . . . 203--213
             A. N. Skorobogatov   On the Number of Representations of
                                  Matroids Over Finite Fields  . . . . . . 215--226

Designs, Codes, and Cryptography
Volume 9, Number 3, November, 1996

       Pier Vittorio Ceccherini   Giuseppe Tallini (1930--1995)  . . . . . 237--245
               Giuseppe Tallini   Combinatorial Problems in Infinite
                                  Spaces . . . . . . . . . . . . . . . . . 247--249
                S. R. Blackburn   A Note on Sequences with the Shift and
                                  Add Property . . . . . . . . . . . . . . 251--256
              Tor Helleseth and   
             P. Vijay Kumar and   
               Abhijit Shanbhag   Codes with the Same Weight Distributions
                                  as the Goethals Codes and the
                                  Delsarte-Goethals Codes  . . . . . . . . 257--266
             Wen-Ai Jackson and   
                Keith M. Martin   Perfect Secret Sharing Schemes on Five
                                  Participants . . . . . . . . . . . . . . 267--286
             Wen-Ai Jackson and   
            Keith M. Martin and   
           Christine M. O'Keefe   A Construction for Multisecret Threshold
                                  Schemes  . . . . . . . . . . . . . . . . 287--303
             Ueli M. Maurer and   
                   Yacov Yacobi   A Non-interactive Public-Key
                                  Distribution System  . . . . . . . . . . 305--316
   Cécile Huybrechts and   
                 Antonio Pasini   On $c^{n-2}.c^*$ geometries of order $2$ 317--330


Designs, Codes, and Cryptography
Volume 10, Number 1, January, 1997

               Stephen D. Cohen   The Length of Primitive BCH Codes with
                                  Minimal Covering Radius  . . . . . . . . 5--16
                     Jean Conan   On the enumeration and generation of
                                  nonweight equivalent rate $\frac 12$
                                  convolutional codes  . . . . . . . . . . 17--27
  András Gács and   
       Péter Sziklai and   
          Tamás Sz\Honyi   Two Remarks on Blocking Sets and Nuclei
                                  in Planes of Prime Order . . . . . . . . 29--39
                  Noboru Hamada   A Necessary and Sufficient Condition for
                                  the Existence of Some Ternary $[n, k,
                                  d]$ Codes Meeting the Greismer Bound . . 41--56
                   Gerhard Hiss   On the Incidence Matrix of the Ree
                                  Unital . . . . . . . . . . . . . . . . . 57--62
           Marijn van Eupen and   
                 Petr Lison\vek   Classification of Some Optimal Ternary
                                  Linear Codes of Small Length . . . . . . 63--84
               A. J. van Zanten   Lexicographic Order and Linearity  . . . 85--97

Designs, Codes, and Cryptography
Volume 10, Number 2, February, 1997

              Dieter Jungnickel   Preface  . . . . . . . . . . . . . . . . 107--107
            Arrigo Bonisoli and   
Gábor Korchmáros and   
       Tamás Szönyi   Some Multiply Derived Translation Planes
                                  with ${\rm SL}(2,5)$ as an Inherited
                                  Collineation Group in the Translation
                                  Complement . . . . . . . . . . . . . . . 109--114
            Sabine Bouzette and   
         Francis Buekenhout and   
                Edmond Dony and   
              Alain Gottcheiner   A Theory of Nets for Polyhedra and
                                  Polytopes Related to Incidence
                                  Geometries . . . . . . . . . . . . . . . 115--136
           Claudia Broecker and   
         Ralph-Hardo Schulz and   
                  Gernot Stroth   Check Character Systems Using Chevalley
                                  Groups . . . . . . . . . . . . . . . . . 137--143
             Aiden A. Bruen and   
                David L. Wehlau   Partitioning Quadrics, Symmetric Group
                                  Divisible Designs and Caps . . . . . . . 145--155
           A. R. Calderbank and   
                Gary M. McGuire   Construction of a $(64,2^{37},12)$ code
                                  via Galois rings . . . . . . . . . . . . 157--165
          Robert S. Coulter and   
                Rex W. Matthews   Planar Functions and Planes of
                                  Lenz-Barlotti Class II . . . . . . . . . 167--184
             Wen-Ai Jackson and   
                  Peter R. Wild   On GMW Designs and Cyclic Hadamard
                                  Designs  . . . . . . . . . . . . . . . . 185--191
          Norman L. Johnson and   
             Guglielmo Lunardon   Maximal Partial Spreads and Flocks . . . 193--202
            Alan C. H. Ling and   
                Xiaojun Zhu and   
        Charles J. Colbourn and   
               Ronald C. Mullin   Pairwise Balanced Designs with
                                  Consecutive Block Sizes  . . . . . . . . 203--222
                 Siu Lun Ma and   
               Bernhard Schmidt   Difference Sets Corresponding to a Class
                                  of Symmetric Designs . . . . . . . . . . 223--236
              Rudolf Mathon and   
                 Tran Van Trung   Unitals and Unitary Polarities in
                                  Symmetric Designs  . . . . . . . . . . . 237--250
                   Klaus Metsch   Embedding the Linear Structure of Planar
                                  Spaces into Projective Spaces  . . . . . 251--263

Designs, Codes, and Cryptography
Volume 10, Number 3, March, 1997

              R. J. R. Abel and   
        Charles J. Colbourn and   
               Jianxing Yin and   
                   Hantao Zhang   Existence of incomplete transversal
                                  designs with block size five and any
                                  index $\lambda$  . . . . . . . . . . . . 275--307
       Lynn Margaret Batten and   
              Kris Coolsaet and   
            Anne Penfold Street   Blocking sets in $(v,\{2,4\},1)$-designs 309--314
       Margaret Ann Bernard and   
                 Bhu Dev Sharma   Linear Codes with Non-Uniform Error
                                  Correction Capability  . . . . . . . . . 315--323
              Diane Erdmann and   
                    Sean Murphy   An Approximate Distribution for the
                                  Maximum Order Complexity . . . . . . . . 325--339
                  A. Faldum and   
                     W. Willems   Codes of Small Defect  . . . . . . . . . 341--350
            Alice E. D. Houston   On the limit of maximal density of
                                  sequences with a Perfect Linear
                                  Complexity Profile . . . . . . . . . . . 351--359
                   Zhe-Xian Wan   State Spaces of Convolutional Codes  . . 361--369


Designs, Codes, and Cryptography
Volume 11, Number 1, April, 1997

                  Marco Buratti   From a $(G, k, 1)$ to a $(Ck \oplus G,
                                  k, 1)$ difference family . . . . . . . . 5--9
                  Marco Buratti   On Resolvable Difference Families  . . . 11--23
          T. Aaron Gulliver and   
                 Masaaki Harada   Classification of Extremal Double
                                  Circulant Formally Self-Dual Even Codes  25--35
                   E. R. Lamken   The Existence of Partitioned Generalized
                                  Balanced Tournament Designs with Block
                                  Size $3$ . . . . . . . . . . . . . . . . 37--71
                 Siu Lun Ma and   
             Surinder K. Sehgal   A Family of Semi-Regular Divisible
                                  Difference Sets  . . . . . . . . . . . . 73--78
              Stephanie Perkins   Codes with a Disparity Property  . . . . 79--97

Designs, Codes, and Cryptography
Volume 11, Number 2, May, 1997

               Carlo Blundo and   
          Alfredo de Santis and   
          Roberto de Simone and   
                    Ugo Vaccaro   Tight Bounds on the Information Rate of
                                  Secret Sharing Schemes . . . . . . . . . 107--122
              Malcolm Greig and   
                    Julian Abel   Resolvable Balanced Incomplete Block
                                  Designs with Block Size $8$  . . . . . . 123--140
          T. Aaron Gulliver and   
                 Masaaki Harada   Weight Enumerators of Double Circulant
                                  Codes and New Extremal Self-Dual Codes   141--150
Patric R. J. Östergård and   
Heikki O. Hämäläinen   A New Table of Binary/Ternary Mixed
                                  Covering Codes . . . . . . . . . . . . . 151--178
            Eric R. Verheul and   
         Henk C. A. van Tilborg   Constructions and properties of $k$ out
                                  of $n$ visual secret sharing schemes . . 179--196

Designs, Codes, and Cryptography
Volume 11, Number 3, July, 1997

         Jürgen Bierbrauer   Universal Hashing and Geometric Codes    207--221
             Simon R. Blackburn   A Generalized Rational Interpolation
                                  Problem and the Solution of the
                                  Welch-Berlekamp Key Equation . . . . . . 223--234
                  C. Blundo and   
          A. Giorgio Gaggia and   
                  D. R. Stinson   On the Dealer's Randomness Required in
                                  Secret Sharing Schemes . . . . . . . . . 235--259
              A. E. Brouwer and   
                   M. van Eupen   The Correspondence Between Projective
                                  Codes and $2$-weight Codes . . . . . . . 261--266
             James A. Davis and   
             Surinder K. Sehgal   Using the Simplex Code to Construct
                                  Relative Difference Sets in $2$-groups   267--277
         G. B. Khosrovshahi and   
          A. Nowzari-Dalini and   
                      R. Torabi   Trading Signed Designs and Some New
                                  $4-(12, 5, 4)$ Designs . . . . . . . . . 279--288
                     A. Klapper   Cross-Correlations of Quadratic Form
                                  Sequences in Odd Characteristic  . . . . 289--305


Designs, Codes, and Cryptography
Volume 12, Number 1, September, 1997

                 Iliya Boukliev   Some New Optimal Ternary Linear Codes    5--11
             Mike Burmester and   
             Yvo G. Desmedt and   
                 Fred Piper and   
                 Michael Walker   A General Zero-Knowledge Scheme  . . . . 13--37
              Stefka Buyuklieva   On the Binary Self-Dual Codes with an
                                  Automorphism of Order $2$  . . . . . . . 39--48
                 R. Craigen and   
                  H. Kharaghani   Hadamard Matrices from Weighing Matrices
                                  via Signed Groups  . . . . . . . . . . . 49--58
                  F. Franek and   
                    A. Rosa and   
                   T. S. Griggs   Large Sets of Mutually Almost Disjoint
                                  Steiner Triple Systems Not From Steiner
                                  Quadruple Systems  . . . . . . . . . . . 59--67
                   J. L. Hayden   Generalized Hadamard Matrices  . . . . . 69--73
                 Xiang-Dong Hou   The Reed--Muller code $R(1,7)$ is normal 75--82
                 Tatsuya Maruta   On the Achievement of the Griesmer Bound 83--87
                      L. Storme   Normal Rational Curves Over Prime Fields 89--96

Designs, Codes, and Cryptography
Volume 12, Number 2, October, 1997

              Hanno Lefmann and   
        Pavel Pudlák and   
                 Petr Savick\'y   On Sparse Parity Check Matrices  . . . . 107--130
        Vladimir I. Levenshtein   Split Orthogonal Arrays and Maximum
                                  Independent Resilient Systems of
                                  Functions  . . . . . . . . . . . . . . . 131--160
                Marten van Dijk   A Linear Construction of Secret Sharing
                                  Schemes  . . . . . . . . . . . . . . . . 161--201

Designs, Codes, and Cryptography
Volume 12, Number 3, November, 1997

         Evangelos Kranakis and   
           Paul C. Van Oorschot   Introduction . . . . . . . . . . . . . . 213--213
                Doug R. Stinson   On Some Methods for Unconditionally
                                  Secure Key Distribution and Broadcast
                                  Encryption . . . . . . . . . . . . . . . 215--243
                  N. Rogier and   
                Pascal Chauvaud   ${\rm MD}2$ is not secure without the
                                  checksum byte  . . . . . . . . . . . . . 245--251
             Vincent Rijmen and   
               Bart Preneel and   
                    Erik De Win   On Weaknesses of Non-surjective Round
                                  Functions  . . . . . . . . . . . . . . . 253--266
                     J. Lee and   
                 H. M. Heys and   
                  S. E. Tavares   Resistance of a CAST-Like Encryption
                                  Algorithm to Linear and Differential
                                  Cryptanalysis  . . . . . . . . . . . . . 267--282
              Carlisle M. Adams   Constructing Symmetric Ciphers Using the
                                  CAST Design Procedure  . . . . . . . . . 283--316


Designs, Codes, and Cryptography
Volume 13, Number 1, January, 1998

          R. Julian R. Abel and   
                  Malcolm Greig   Balanced Incomplete Block Designs with
                                  Block Size $7$ . . . . . . . . . . . . . 5--30
              E. F. Assmus, Jr.   Linearly Derived Steiner Triple Systems  31--49
                Aiden Bruen and   
              Lucien Haddad and   
                   David Wehlau   Caps and Colouring Steiner Triple
                                  Systems  . . . . . . . . . . . . . . . . 51--55
               Gary McGuire and   
        Vladimir D. Tonchev and   
                 Harold N. Ward   Characterizing the Hermitian and Ree
                                  Unitals on $28$ Points . . . . . . . . . 57--61
                  Helmut Siemon   A number-theoretic conjecture and the
                                  existence of $S$-cyclic Steiner
                                  quadruple systems  . . . . . . . . . . . 63--94

Designs, Codes, and Cryptography
Volume 13, Number 2, February, 1998

           Darryn E. Bryant and   
                     A. Khodkar   On Orthogonal Double Covers of Graphs    103--105
             L. R. A. Casse and   
               K. M. Martin and   
                     P. R. Wild   Bounds and Characterizations of
                                  Authentication/Secrecy Schemes . . . . . 107--129
             James A. Davis and   
            Jonathan Jedwab and   
                Miranda Mowbray   New Families of Semi-Regular Relative
                                  Difference Sets  . . . . . . . . . . . . 131--146
              J. Fitzgerald and   
                      R. F. Lax   Decoding affine variety codes using
                                  Gröbner bases . . . . . . . . . . . . . . 147--158
      Kirsten Mackenzie-Fleming   A Recursive Construction for $2$-Designs 159--164
              Noboru Hamada and   
               Marijn van Eupen   The Nonexistence of Ternary $[38, 6,
                                  23]$ Codes . . . . . . . . . . . . . . . 165--172
              T. S. Michael and   
                   W. D. Wallis   Skew-Hadamard Matrices and the Smith
                                  Normal Form  . . . . . . . . . . . . . . 173--176
                Ilene H. Morgan   Equiorthogonal Frequency Hypercubes:
                                  Preliminary Theory . . . . . . . . . . . 177--185
              Pratima Panigrahi   The collinearity graph of the $O^-(8,2)$
                                  quadric is not geometrisable . . . . . . 187--198
                Corrado Zanella   Linear sections of the finite Veronese
                                  varieties and authentication systems
                                  defined using geometry . . . . . . . . . 199--212

Designs, Codes, and Cryptography
Volume 13, Number 3, March, 1998

      Tsonka Stefanova Baicheva   The Covering Radius of Ternary Cyclic
                                  Codes with Length up to $25$ . . . . . . 223--227
              J. J. Brennan and   
                    Bruce Geist   Analysis of iterated modular
                                  exponentiation: the orbits of
                                  $x^\alpha\bmod N$  . . . . . . . . . . . 229--245
                   Yu Qing Chen   A Construction of Difference Sets  . . . 247--250
    Dragomir \vZ. \Dbarokovi\'c   Note on Periodic Complementary Sets of
                                  Binary Sequences . . . . . . . . . . . . 251--256
          T. Aaron Gulliver and   
                 Masaaki Harada   Classification of Extremal Double
                                  Circulant Self-Dual Codes of Lengths
                                  $64$ to $72$ . . . . . . . . . . . . . . 257--269
                 Masaaki Harada   New extremal type II codes over $\bold
                                  Z_4$ . . . . . . . . . . . . . . . . . . 271--284
              Ilia Krasikov and   
                   Simon Litsyn   Bounds on Spectra of Codes with Known
                                  Dual Distance  . . . . . . . . . . . . . 285--297
                R. Safavi-Naini   Three Systems for Threshold Generation
                                  of Authenticators  . . . . . . . . . . . 299--312
                 A. A. Zain and   
                B. Sundar Rajan   Quasideterminant Characterization of MDS
                                  Group Codes over Abelian Groups  . . . . 313--330


Designs, Codes, and Cryptography
Volume 14, Number 1, April, 1998

              F. E. Bennett and   
                     J. Yin and   
                   H. Zhang and   
                  R. J. R. Abel   Perfect Mendelsohn Packing Designs with
                                  Block Size Five  . . . . . . . . . . . . 5--22
        Sergei V. Bezzateev and   
          Natalia A. Shekhunova   A Subclass of Binary Goppa Codes With
                                  Improved Estimation of the Code
                                  Dimension  . . . . . . . . . . . . . . . 23--38
             David B. Jaffe and   
            Vladimir D. Tonchev   Computing Linear Codes and Unitals . . . 39--52
                  Marc Joye and   
        Jean-Jacques Quisquater   Reducing the Elliptic Curve Cryptosystem
                                  of Meyer-Müller to the Cryptosystem of
                                  Rabin-Williams . . . . . . . . . . . . . 53--56
 Çetin K. Koç and   
                     Tolga Acar   Montgomery multiplication in ${\rm
                                  GF}(2^k)$  . . . . . . . . . . . . . . . 57--69
              Tero Laihonen and   
                   Simon Litsyn   On Upper Bounds for Minimum Distance 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

Designs, Codes, and Cryptography
Volume 14, Number 2, May, 1998

               Alexei Ashikhmin   On Generalized Hamming Weights for
                                  Galois Ring Linear Codes . . . . . . . . 107--126
             Aiden A. Bruen and   
                  Keldon Drudge   On the non-existence of certain
                                  Cameron-Liebler line classes in ${\rm
                                  PG}(3, q)$ . . . . . . . . . . . . . . . 127--132
              Claude Carlet and   
               Philippe Guillot   An Alternate Characterization of the
                                  Bentness of Binary Functions, with
                                  Uniqueness . . . . . . . . . . . . . . . 133--140
        Charles J. Colbourn and   
                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 and   
             Scott Vanstone and   
              Robert Zuccherato   Discrete Logarithm Based Cryptosystems
                                  in Quadratic Function Fields of
                                  Characteristic $2$ . . . . . . . . . . . 159--178
            Juriaan Simonis and   
               Alexei Ashikhmin   Almost Affine Codes  . . . . . . . . . . 179--197

Designs, Codes, and Cryptography
Volume 14, Number 3, September, 1998

        Amir H. Banihashemi and   
               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
                 Jingmin He and   
                      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
            Doug R. Stinson and   
                 Tran Van Trung   Some New Results on Key Distribution
                                  Patterns and Broadcast Encryption  . . . 261--279
            Marten van Dijk and   
         Christian Gehrmann and   
                     Ben Smeets   Unconditionally Secure Group
                                  Authentication . . . . . . . . . . . . . 281--296
                  Helmut Siemon   Erratum: ``A number-theoretic conjecture
                                  and the existence of $S$-cyclic Steiner
                                  quadruple systems'' [Des. Codes
                                  Cryptogr. \bf 13 (1998), no. 1, 63--94;
                                  1 600 695] . . . . . . . . . . . . . . . 297--297


Designs, Codes, and Cryptography
Volume 15, Number 1, October, 1998

               Anton Betten and   
            Adalbert Kerber and   
              Reinhard Laue and   
              Alfred Wassermann   Simple $8$-Designs with Small Parameters 5--27
          Roberto De Prisco and   
              Alfredo De Santis   On Lower Bounds for the Redundancy of
                                  Optimal Codes  . . . . . . . . . . . . . 29--45
                 Wende Chen and   
           Torleiv Klòve   Weight Hierarchies of Linear Codes
                                  Satisfying the Chain Condition . . . . . 47--66
             Christian Gehrmann   Multiround Unconditionally Secure
                                  Authentication . . . . . . . . . . . . . 67--86
             Kaoru Kurosawa and   
                 Koji Okada and   
               Hajime Saido and   
             Douglas R. Stinson   New Combinatorial Bounds for
                                  Authentication Codes and Key
                                  Predistribution Schemes  . . . . . . . . 87--100

Designs, Codes, and Cryptography
Volume 15, Number 2, 1998

              Ross Anderson and   
              Cunsheng Ding and   
              Tor Helleseth and   
           Torleiv Klòve   How to build robust shared control
                                  systems  . . . . . . . . . . . . . . . . 111--124
              Claude Carlet and   
            Pascale Charpin and   
                Victor Zinoviev   Codes, bent functions and permutations
                                  suitable for DES-like cryptosystems  . . 125--156
                 Wende Chen and   
                   Zhi Chen and   
           Torleiv Klòve   New constructions of disjoint distinct
                                  difference sets  . . . . . . . . . . . . 157--165
                    K. Chen and   
                         L. Zhu   Existence of $(q,6,1)$ difference
                                  families with $q$ a prime power  . . . . 167--173
              Tor Helleseth and   
             P. Vijay Kumar and   
               Kyeongcheol Yang   An infinite family of $3$-designs from
                                  Preparata codes over ${Z}_4$ . . . . . . 175--181
               Markku Kaikkonen   Codes from affine permutation groups . . 183--186
            A. A. I. Perera and   
                  K. J. Horadam   Cocyclic generalised Hadamard matrices
                                  and central relative difference sets . . 187--200
           Kyeongcheol Yang and   
                  Tor Helleseth   Two new infinite families of $3$-designs
                                  from Kerdock codes over ${Z}_4$  . . . . 201--214

Designs, Codes, and Cryptography
Volume 15, Number 3, December, 1998

                K. T. Arasu and   
                       S. L. Ma   Abelian Difference Sets Without
                                  Self-conjugacy . . . . . . . . . . . . . 223--230
                    Simeon Ball   Partial Unitals and Related Structures
                                  in Desarguesian Planes . . . . . . . . . 231--236
             M. C. Bhandari and   
          K. K. P. Chanduka and   
                      A. K. Lal   On Lower Bounds For Covering Codes . . . 237--243
                Ivan N. Landjev   The Nonexistence of Some Optimal Ternary
                                  Codes of Dimension Five  . . . . . . . . 245--258
            Hiroyuki Ohmori and   
               Takashi Miyamoto   Construction of Weighing Matrices
                                  $(17,9)$ Having the Intersection Number
                                  $8$  . . . . . . . . . . . . . . . . . . 259--269
              Nabil Shalaby and   
                   Jianxing Yin   Nested Optimal $\lambda$-Packings and
                                  $\lambda$-Coverings of Pairs with
                                  Triples  . . . . . . . . . . . . . . . . 271--278
              Brett Stevens and   
                Lucia Moura and   
                Eric Mendelsohn   Lower Bounds for Transversal Covers  . . 279--299
            Marten van Dijk and   
             Wen-Ai Jackson and   
                Keith M. Martin   A General Decomposition Construction for
                                  Incomplete Secret Sharing Schemes  . . . 301--321


Designs, Codes, and Cryptography
Volume 16, Number 1, January, 1999

             M. C. Bhandari and   
                M. K. Gupta and   
                      A. K. Lal   Some Results on NQR Codes  . . . . . . . 5--9
         Simon Blake-Wilson and   
                Kevin T. Phelps   Constant Weight Codes and Group
                                  Divisible Designs  . . . . . . . . . . . 11--27
       Alexander A. Davydov and   
        Patric R. J. Ostergaard   New Linear Codes with Covering Radius
                                  $2$ and Odd Basis  . . . . . . . . . . . 29--39
                 Vikram Jha and   
                 Norman Johnson   Cyclic Ostrom Spreads  . . . . . . . . . 41--51
             Kaoru Kurosawa and   
                   Wakaha Ogata   Efficient Rabin-type Digital Signature
                                  Scheme . . . . . . . . . . . . . . . . . 53--64
Patric R. J. Ostergård and   
             William D. Weakley   Constructing Covering Codes with Given
                                  Automorphisms  . . . . . . . . . . . . . 65--73
               Carles Padro and   
  Germán Sáez and   
              Jorge Luis Villar   Detection of Cheaters in Vector Space
                                  Secret Sharing Schemes . . . . . . . . . 75--85
              Keisuke Shiromoto   The Weight Enumerator of Linear Codes
                                  over GF$(qm)$ Having Generator Matrix
                                  over GF$(q)$ . . . . . . . . . . . . . . 87--92

Designs, Codes, and Cryptography
Volume 16, Number 2, February, 1999

                    A. Barg and   
                   A. Ashikhmin   Binomial Moments of the Distance
                                  Distribution and the Probability of
                                  Undetected Error . . . . . . . . . . . . 103--116
                  Marco Buratti   Some $(17q, 17, 2)$ and $(25q, 25, 3)$
                                  BIBD Constructions . . . . . . . . . . . 117--120
                Paul Camion and   
                  Anne Canteaut   Correlation-Immune and Resilient
                                  Functions Over a Finite Alphabet and
                                  Their Applications in Cryptography . . . 121--149
                  Yves Edel and   
         Jürgen Bierbrauer   $41$ is the Largest Size of a Cap in
                                  ${\rm PG}(4,4)$  . . . . . . . . . . . . 151--160
                  Graham Norton   On Minimal Realization Over a Finite
                                  Chain Ring . . . . . . . . . . . . . . . 161--178
            Kevin T. Phelps and   
                     Mike LeVan   Switching Equivalence Classes of Perfect
                                  Codes  . . . . . . . . . . . . . . . . . 179--184
           A. J. van Zanten and   
                   Agung Lukito   Construction of Certain Cyclic
                                  Distance-Preserving Codes Having
                                  Linear-Algebraic Characteristics . . . . 185--199

Designs, Codes, and Cryptography
Volume 16, Number 3, May, 1999

               L. M. Batten and   
                    J. M. Dover   Some Sets of Type in Cubic Order Planes  211--213
           Alexis Bonnecaze and   
           Bernard Mourrain and   
            Patrick Solé   Jacobi Polynomials, Type II Codes, and
                                  Designs  . . . . . . . . . . . . . . . . 215--234
          M. A. Chateauneuf and   
        Charles J. Colbourn and   
                   D. L. Kreher   Covering Arrays of Strength Three  . . . 235--242
            Sebastian Egner and   
                    Thomas Beth   How to Play $M_{13}$?  . . . . . . . . . 243--247
           John Friedlander and   
             Michael Larsen and   
              Daniel Lieman and   
               Igor Shparlinski   On The Correlation Of Binary
                                  $M$-sequences  . . . . . . . . . . . . . 249--256
           Philippe Gaborit and   
                 Masaaki Harada   Construction of Extremal Type II Codes
                                  over ${\bf Z}_4$ . . . . . . . . . . . . 257--269
              William J. Martin   Designs in Product Association Schemes   271--289
     Deirdre Longacher Smeltzer   Properties of Codes from Difference Sets
                                  in $2$-Groups  . . . . . . . . . . . . . 291--306


Designs, Codes, and Cryptography
Volume 17, Number 1--3, September, 1999

                      Anonymous   Guest Editorial  . . . . . . . . . . . . 5--6
                  J. D. Key and   
             H. F. Mattson, Jr.   Edward F. Assmus, Jr. (1931--1998) . . . 7--11
                      Anonymous   Ed Assmus  . . . . . . . . . . . . . . . 13--14
             Aiden A. Bruen and   
                David L. Wehlau   Long Binary Linear Codes and Large Caps
                                  in Projective Space  . . . . . . . . . . 37--60
               Bernhard Schmidt   Williamson Matrices and a Conjecture of
                                  Ito's  . . . . . . . . . . . . . . . . . 61--68
                   Yu Qing Chen   On a Family of Covering Extended
                                  Building Sets  . . . . . . . . . . . . . 69--72
                 Harold N. Ward   An Introduction to Divisible Codes . . . 73--79
            Pascale Charpin and   
 Aimo Tietäväinen and   
                Victor Zinoviev   On the Minimum Distances of Non-Binary
                                  Cyclic Codes . . . . . . . . . . . . . . 81--85
                   G. Cohen and   
                  J. Rif\`a and   
                    J. Tena and   
                G. Zémor   On the Characterization of Linear
                                  Uniquely Decodable Codes . . . . . . . . 87--96
             Joseph A. Thas and   
          Hendrik Van Maldeghem   On Embeddings of the Flag Geometries of
                                  Projective Planes in Finite Projective
                                  Spaces . . . . . . . . . . . . . . . . . 97--104
             Neil J. Calkin and   
                  J. D. Key and   
               M. J. De Resmini   Minimum Weight and Dimension Formulas
                                  for Some Geometric Codes . . . . . . . . 105--120
            Vladimir D. Tonchev   Linear Perfect Codes and a
                                  Characterization of the Classical
                                  Designs  . . . . . . . . . . . . . . . . 121--128
              Jörg Eisfeld   The Eigenspaces of the
                                  Bose-Mesner-Algebras of the Association
                                  Schemes corresponding to Projective
                                  Spaces and Polar Spaces  . . . . . . . . 129--150
                       Ray Hill   An Extension Theorem for Linear Codes    151--157
                  Yury J. Ionin   Building Symmetric Designs With Building
                                  Sets . . . . . . . . . . . . . . . . . . 159--175
                 Hans Dobbertin   Another Proof of Kasami's Theorem  . . . 177--180
               Anton Betten and   
              Reinhard Laue and   
              Alfred Wassermann   A Steiner $5$-Design on $36$ Points  . . 181--186
          Willem H. Haemers and   
        René Peeters and   
     Jeroen M. van Rijckevorsel   Binary Codes of Strongly Regular Graphs  187--209
                     Qing Xiang   Maximally Nonlinear Functions and Bent
                                  Functions  . . . . . . . . . . . . . . . 211--218
                   Klaus Metsch   A Bose-Burton Theorem for Elliptic Polar
                                  Spaces . . . . . . . . . . . . . . . . . 219--224
                   J. F. Dillon   Multiplicative Difference Sets via
                                  Additive Characters  . . . . . . . . . . 225--235
                Simeon Ball and   
              Aart Blokhuis and   
           Christine M. O'Keefe   On Unitals with Many Baer Sublines . . . 237--252
                G. L. Ebert and   
            J. W. P. Hirschfeld   Complete Systems of Lines on a Hermitian
                                  Surface over a Finite Field  . . . . . . 253--268
              Tor Helleseth and   
                Victor Zinoviev   On $Z_4$-Linear Goethals Codes and
                                  Kloosterman Sums . . . . . . . . . . . . 269--288
              Richard M. Wilson   Signed Hypergraph Designs and Diagonal
                                  Forms for Some Incidence Matrices  . . . 289--297
                A. Blokhuis and   
                  A. E. Brouwer   The Universal Embedding Dimension of the
                                  Near Polygon on the $1$-Factors of a
                                  Complete Graph . . . . . . . . . . . . . 299--303
             James A. Davis and   
                Jonathan Jedwab   A New Family of Relative Difference Sets
                                  in $2$-Groups  . . . . . . . . . . . . . 305--312


Designs, Codes, and Cryptography
Volume 18, Number 1--3, December, 1999

          Dieter Jungnickel and   
                  Jack van Lint   Editorial  . . . . . . . . . . . . . . . 5--6
                K. T. Arasu and   
                     N. J. Voss   Answering a Question of Pott on Almost
                                  Perfect Sequences  . . . . . . . . . . . 7--10
               Christine Bachoc   On Harmonic Weight Enumerators of Binary
                                  Codes  . . . . . . . . . . . . . . . . . 11--28
          Thierry P. Berger and   
                Pascale Charpin   The Automorphism Groups of BCH Codes and
                                  of Some Affine-Invariant Codes Over
                                  Extension Fields . . . . . . . . . . . . 29--53
            Wayne Broughton and   
                   Gary McGuire   Some Observations on Quasi-$3$ Designs
                                  and Hadamard Matrices  . . . . . . . . . 55--61
           Matthew R. Brown and   
       Christine M. O'Keefe and   
                   Tim Penttila   Triads, Flocks of Conics and
                                  $Q^{-(5,1)}$ . . . . . . . . . . . . . . 63--70
     Gérard D. Cohen and   
          Sylvia B. Encheva and   
            Gilles Zémor   Antichain Codes  . . . . . . . . . . . . 71--80
          Charles A. Cusack and   
           Spyros S. Magliveras   Semiregular Large Sets . . . . . . . . . 81--87
                 D. de Caen and   
                  E. R. van Dam   Association Schemes Related to Kasami
                                  Codes and Kerdock Sets . . . . . . . . . 89--102
               Iwan Duursma and   
              Tor Helleseth and   
              Chunming Rong and   
               Kyeongcheol Yang   Split Weight Enumerators for the
                                  Preparata Codes with Applications to
                                  Designs  . . . . . . . . . . . . . . . . 103--124
               J. E. Fields and   
                 P. Gaborit and   
              W. C. Huffman and   
                       V. Pless   On the Classification of Extremal Even
                                  Formally Self-Dual Codes . . . . . . . . 125--148
                Shuhong Gao and   
                   Jason Howell   A General Polynomial Sieve . . . . . . . 149--157
                    Chat Yin Ho   Incidence Matrices and Collineations of
                                  Finite Projective Planes . . . . . . . . 159--162
                   H. Janwa and   
             H. F. Mattson, Jr.   Some Upper Bounds on the Covering Radii
                                  of Linear Codes Over and Their
                                  Applications . . . . . . . . . . . . . . 163--181
         G. B. Khosrovshahi and   
                  Reza Naserasr   Hypergraphical Codes Arising from Binary
                                  Trades . . . . . . . . . . . . . . . . . 183--186
              Rudolf Mathon and   
                 Tran van Trung   Directed $t$-Packings and Directed
                                  $t$-Steiner Systems  . . . . . . . . . . 187--198
               Klaus Metsch and   
                      L. Storme   Partial $t$-Spreads in
                                  $\mbox{PG}(2t+1,q)$  . . . . . . . . . . 199--216
                 Alan R. Prince   Flag-Transitive Affine Planes of Order
                                  $64$ . . . . . . . . . . . . . . . . . . 217--221
         Mattias Svanström   A Class of Perfect Ternary
                                  Constant-Weight Codes  . . . . . . . . . 223--229
              Jack van Lint and   
                 Ludo Tolhuizen   On Perfect Ternary Constant Weight Codes 231--234
           Tamás Szhonyi   On the Embedding of $(k,p)$-Arcs is
                                  Maximal Arcs . . . . . . . . . . . . . . 235--246


Designs, Codes, and Cryptography
Volume 19, Number 1, January, 2000

               J. H. Dinitz and   
                   E. R. Lamken   HOPs and COPs: Room frames with
                                  partitionable transversals . . . . . . . 5--26
                  Todd D. Vance   A Gap in GRM Code Weight Distributions   27--43
              Xian-Mo Zhang and   
              Yuliang Zheng and   
                    Hideki Imai   Relating Differential Distribution
                                  Tables to Other Properties of of
                                  Substitution Boxes . . . . . . . . . . . 45--63

Designs, Codes, and Cryptography
Volume 19, Number 2--3, March, 2000

                   Neal Koblitz   Guest Editorial  . . . . . . . . . . . . 75--76
             Simon Blake-Wilson   Information Security, Mathematics, and
                                  Public-Key Cryptography  . . . . . . . . 77--99
               Arjen K. Lenstra   Integer Factoring  . . . . . . . . . . . 101--128
                 Andrew Odlyzko   Discrete Logarithms: The Past and the
                                  Future . . . . . . . . . . . . . . . . . 129--145
             Ueli M. Maurer and   
                    Stefan Wolf   The Diffie--Hellman Protocol . . . . . . 147--171
               Neal Koblitz and   
             Alfred Menezes and   
                 Scott Vanstone   The State of Elliptic Curve Cryptography 173--193
              Jerome A. Solinas   Efficient Arithmetic on Koblitz Curves   195--249


Designs, Codes, and Cryptography
Volume 20, Number 1, April, 2000

            Joseph H. Silverman   The Xedni Calculus and the Elliptic
                                  Curve Discrete Logarithm Problem . . . . 5--40
        Michael J. Jacobson and   
               Neal Koblitz and   
        Joseph H. Silverman and   
              Andreas Stein and   
                    Edlyn Teske   Analysis of the Xedni Calculus Attack    41--64
             James M. McQuillan   Pencils of Hyperconics in Projective
                                  Planes of Characteristic Two . . . . . . 65--71
               Jacques Wolfmann   Difference Sets in $Z_4^m$ and
                                  $F_2^{2m}$ . . . . . . . . . . . . . . . 73--88
         Ralph-Hardo Schulz and   
         Antonino Giorgio Spera   Automorphisms of Constant Weight Codes
                                  and of Divisible Designs . . . . . . . . 89--97

Designs, Codes, and Cryptography
Volume 20, Number 2, June, 2000

    Grégoire Bommier and   
               Francis Blanchet   Binary Quasi-Cyclic Goppa Codes  . . . . 107--124
           Graham H. Norton and   
          Ana Salagean-Mandache   On the Key Equation Over a Commutative
                                  Ring . . . . . . . . . . . . . . . . . . 125--141
            Arrigo Bonisoli and   
             Antonio Cossidente   Mixed Partitions of Projective
                                  Geometries . . . . . . . . . . . . . . . 143--154
          A. Halbutogullari and   
                      C. K. Koc   Parallel Multiplication in using
                                  Polynomial Residue Arithmetic  . . . . . 155--173
                Jacques Patarin   Cryptanalysis of the Matsumoto and Imai
                                  Public Key Scheme of Eurocrypt'98  . . . 175--209

Designs, Codes, and Cryptography
Volume 20, Number 3, July, 2000

        Charles J. Colbourn and   
                    Sufang Zhao   Maximum Kirkman Signal Sets for
                                  Synchronous Uni-Polar Multi-User
                                  Communication Systems  . . . . . . . . . 219--227
          Sylvia B. Encheva and   
         Gérard D. Cohen   Linear Codes and Their Coordinate
                                  Ordering . . . . . . . . . . . . . . . . 229--250
                 Xiang-dong Hou   Bent Functions, Partial Difference Sets,
                                  and Quasi-Frobenius Local Rings  . . . . 251--268
                  Ari Juels and   
                 Marcus Peinado   Hiding Cliques for Cryptographic
                                  Security . . . . . . . . . . . . . . . . 269--280
              Satoshi Obana and   
                 Kaoru Kurosawa   Combinatorial Classification of Optimal
                                  Authentication Codes with Arbitration    281--305
              Pratima Panigrahi   The Non-Collinearity Graph of the
                                  $(8,2)$ Quadric Is Uniquely
                                  Geometrisable  . . . . . . . . . . . . . 307--317
                 Olga Polverino   Small Blocking Sets in $\mbox{PG}(2, p)$ 319--324
            Ching-Nung Yang and   
                  Chi-Sung Laih   New Colored Visual Secret Sharing
                                  Schemes  . . . . . . . . . . . . . . . . 325--336


Designs, Codes, and Cryptography
Volume 21, Number 1--3, October, 2000

              Aart Blokhuis and   
              Willem H. Haemers   Preface  . . . . . . . . . . . . . . . . 5--5
                N. G. de Bruijn   Jaap Seidel 80 . . . . . . . . . . . . . 7--10
             Béla Bajnok   Spherical Designs and Generalized
                                  Sum-Free Sets in Abelian Groups  . . . . 11--18
                R. D. Baker and   
                J. M. Dover and   
                G. L. Ebert and   
                    K. L. Wantz   Perfect Baer Subplane Partitions and
                                  Three-Dimensional Flag-Transitive Planes 19--39
               Peter Beelen and   
                 Ruud Pellikaan   The Newton Polygon of Plane Curves with
                                  Many Rational Points . . . . . . . . . . 41--67
                  A. E. Brouwer   Locally Paley Graphs . . . . . . . . . . 69--76
        Frans C. Bussemaker and   
          Willem H. Haemers and   
                  Edward Spence   The Search for Pseudo Orthogonal Latin
                                  Squares of Order Six . . . . . . . . . . 77--82
               Edwin R. van Dam   A Characterization of Association
                                  Schemes from Affine Spaces . . . . . . . 83--86
            Frank De Clerck and   
                 Mario Delanote   Two-Weight Codes, Partial Geometries and
                                  Steiner Systems  . . . . . . . . . . . . 87--98
              Ralf Gramlich and   
          Hendrik Van Maldeghem   Epimorphisms of Generalized Polygons
                                  Part 1: Geometrical Characterizations    99--111
              Yury J. Ionin and   
               M. S. Shrikhande   Strongly Regular Graphs and Designs with
                                  Three Intersection Numbers . . . . . . . 113--125
        Aleksandar Jurivsic and   
                    Jack Koolen   A Local Approach to $1$-Homogeneous
                                  Graphs . . . . . . . . . . . . . . . . . 127--147
                Jack Koolen and   
            Monique Laurent and   
            Alexander Schrijver   Equilateral Dimension of the Rectilinear
                                  Space  . . . . . . . . . . . . . . . . . 149--164
              Johannes Maks and   
                Juriaan Simonis   Optimal Subcodes of Second Order
                                  Reed--Muller Codes and Maximal Linear
                                  Spaces of Bivectors of Maximal Rank  . . 165--180
              William J. Martin   Minimum Distance Bounds for $s$-Regular
                                  Codes  . . . . . . . . . . . . . . . . . 181--187
         Bernhard Mühlherr   On Isomorphisms between Coxeter Groups   189--189
              L. J. Rylands and   
                   D. E. Taylor   Constructions for Octonion and
                                  Exceptional Jordan Algebras  . . . . . . 191--203
                    Akos Seress   Large Families of Cospectral Graphs  . . 205--208
                       Ron Shaw   Subsets of $\mbox{PG}(n,2)$ and Maximal
                                  Partial Spreads in $\mbox{PG}(4,2)$  . . 209--222
                 Irfan Siap and   
         Dijen K. Ray-Chaudhuri   New Linear Codes Over and and
                                  Improvements on Bounds . . . . . . . . . 223--233
                  L. Storme and   
                     Zs. Weiner   On $1$-Blocking Sets in $\mbox{PG}(n,q),
                                  n\geq 3$ . . . . . . . . . . . . . . . . 235--251


Designs, Codes, and Cryptography
Volume 22, Number 1, January, 2001

                    Akos Seress   All Lambda-Designs With $\lambda = 2^p$
                                  are Type-1 . . . . . . . . . . . . . . . 5--17
         Antonio Cossidente and   
           Domenico Labbate and   
           Alessandro Siciliano   Veronese Varieties Over Finite Fields
                                  and Their Projections  . . . . . . . . . 19--32
                   Sylvie Dubuc   Characterization of Linear Structures    33--45
              Satoshi Obana and   
                 Kaoru Kurosawa   Bounds and Combinatorial Structure of
                                  $(k,n)$ Multi-Receiver $A$-Codes . . . . 47--63
                Joan Daemen and   
            Lars R. Knudsen and   
                 Vincent Rijmen   Linear Frameworks for Block Ciphers  . . 65--87
          T. Aaron Gulliver and   
                 Masaaki Harada   Codes over and Improvements to the
                                  Bounds on Ternary Linear Codes . . . . . 89--96
               Andreas Enge and   
              Dieter Jungnickel   Review . . . . . . . . . . . . . . . . . 97--99

Designs, Codes, and Cryptography
Volume 22, Number 2, March, 2001

           Gretchen L. Matthews   Weierstrass Pairs and Minimum Distance
                                  of Goppa Codes . . . . . . . . . . . . . 107--121
                 Arne Winterhof   Some Estimates for Character Sums and
                                  Applications . . . . . . . . . . . . . . 123--131
                  D. R. Stinson   Something About All or Nothing
                                  (Transforms) . . . . . . . . . . . . . . 133--138
                 Harold N. Ward   The Nonexistence of a $[207,4,165]$ Code
                                  over ${\rm GF}(5)$ . . . . . . . . . . . 139--148
               Kenichiro Tanabe   A New Proof of the Assmus--Mattson
                                  Theorem for Non-Binary Codes . . . . . . 149--155
    Agnes V. Dizon-Garciano and   
                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
                   U. Dempwolff   Primitive Rank $3$ Groups on Symmetric
                                  Designs  . . . . . . . . . . . . . . . . 191--207

Designs, Codes, and Cryptography
Volume 22, Number 3, January, 2001

                 Michel Sebille   There Exists a Simple Non Trivial
                                  $t$-design with an Arbitrarily Large
                                  Automorphism Group for Every $t$ . . . . 215--219
                R. Ahlswede and   
             H. K. Aydinian and   
              L. H. Khachatrian   On Perfect Codes and Related Concepts    221--237
                   R. Scheidler   Cryptography in Quadratic Function
                                  Fields . . . . . . . . . . . . . . . . . 239--264
             Kaoru Kurosawa and   
                  Satoshi Obana   Combinatorial Bounds on Authentication
                                  Codes with Arbitration . . . . . . . . . 265--281
                 Vikram Jha and   
              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
                                  ${\rm PG}(3,7)$  . . . . . . . . . . . . 331--334


Designs, Codes, and Cryptography
Volume 23, Number 1, May, 2001

               Igor Shparlinski   On the Linear Complexity of the Power
                                  Generator  . . . . . . . . . . . . . . . 5--10
           Koichi Betsumiya and   
                 Masaaki Harada   Binary Optimal Odd Formally Self-Dual
                                  Codes  . . . . . . . . . . . . . . . . . 11--22
           Tadashi Wadayama and   
                  Toru Hada and   
          Koichiro Wakasugi and   
                 Masao Kasahara   Upper and Lower Bounds on Maximum
                                  Nonlinearity of $n$-input $m$-output
                                  Boolean Function . . . . . . . . . . . . 23--34
            Blessilda P. Raposa   Some Triple Block Intersection Numbers
                                  of Paley $2$-Designs of QN-type  . . . . 35--52
                   Andreas Enge   The Extended Euclidian Algorithm on
                                  Polynomials, and the Computational
                                  Efficiency of Hyperelliptic
                                  Cryptosystems  . . . . . . . . . . . . . 53--74
                    J. E. Iiams   A Note on Certain 2-Groups with Hadamard
                                  Difference Sets  . . . . . . . . . . . . 75--80
          Christophe Mouaha and   
              Gerhard Schiffels   All $q^m$-ary Cyclic Codes with Cyclic
                                  $q$-ary Image Are Known  . . . . . . . . 81--98
                   Jianxing Yin   A Combinatorial Construction for Perfect
                                  Deletion-Correcting Codes  . . . . . . . 99--110

Designs, Codes, and Cryptography
Volume 23, Number 2, July, 2001

                 I. Honkala and   
                     A. Klapper   Bounds for the Multicovering Radii of
                                  Reed--Muller Codes with Applications to
                                  Stream Ciphers . . . . . . . . . . . . . 131--146
               Igor Shparlinski   On Some Properties of the Shrinking
                                  Generator  . . . . . . . . . . . . . . . 147--156
              Tor Helleseth and   
             P. Vijay Kumar and   
              Halvard Martinsen   A New Family of Ternary Sequences with
                                  Ideal Two-level Autocorrelation Function 157--166
          T. Aaron Gulliver and   
             Nikolai Senkevitch   Optimal Ternary Linear Rate $1/2$ Codes  167--172
                  Luke O'Connor   On String Replacement Exponentiation . . 173--184
              B. N. Cooperstein   Hyperplane Sections of Kantor's Unitary
                                  Ovoids . . . . . . . . . . . . . . . . . 185--196
                  Yves Edel and   
         Jürgen Bierbrauer   Large Caps in Small Spaces . . . . . . . 197--212
                  Kenzi Akiyama   On Certain Schur Rings of Dimension $4$  213--222
              Ilia Krasikov and   
                   Simon Litsyn   On the Distance Distributions of BCH
                                  Codes and Their Duals  . . . . . . . . . 223--232
              Marco Buratti and   
                  Fulvio Zuanni   Perfect Cayley Designs as
                                  Generalizations of Perfect Mendelsohn
                                  Designs  . . . . . . . . . . . . . . . . 233--248
                     J. A. Thas   Characterizations of Translation
                                  Generalized Quadrangles  . . . . . . . . 249--258

Designs, Codes, and Cryptography
Volume 23, Number 3, August, 2001

             C. Koukouvinos and   
                M. Mitrouli and   
               Jennifer Seberry   Values of Minors of $(1,-1)$ Incidence
                                  Matrices of SBIBDs and Their Application
                                  to the Growth Problem  . . . . . . . . . 267--282
      N. A. Howgrave-Graham and   
                    N. P. Smart   Lattice Attacks on Digital Signature
                                  Schemes  . . . . . . . . . . . . . . . . 283--290
                    Sharad Sane   A Proof of the Jungnickel-Tonchev
                                  Conjecture on Quasi-Multiple
                                  Quasi-Symmetric Designs  . . . . . . . . 291--296
                  Marc Joye and   
    Jean-Jacques Quisquater and   
                Tsuyoshi Takagi   How to Choose Secret Parameters for
                                  RSA-Type Cryptosystems over Elliptic
                                  Curves . . . . . . . . . . . . . . . . . 297--316
                K. T. Arasu and   
                   Yu Qing Chen   A Difference Set in $(\mathbb{Z}/4
                                  \mathbb{Z})^3 \times
                                  \mathbb{Z}/5\mathbb{Z}$  . . . . . . . . 317--324
           Koichi Betsumiya and   
                 Masaaki Harada   Classification of Formally Self-Dual
                                  Even Codes of Lengths up to $16$ . . . . 325--332
        Galina T. Bogdanova and   
         Andries E. Brouwer and   
         Stoian N. Kapralov and   
Patric R. J. Östergård   Error-Correcting Codes over an Alphabet
                                  of Four Elements . . . . . . . . . . . . 333--342
          Kanat S. Abdukhalikov   Affine Invariant and Cyclic Codes over
                                  $p$-adic Numbers and Finite Rings  . . . 343--370


Designs, Codes, and Cryptography
Volume 24, Number 1, September, 2001

                      G. Hughes   Structure Theorems for Group Ring Codes
                                  with an Application to Self-Dual Codes   5--14
               Houshou Chen and   
                 John T. Coffey   Trellis Structure and Higher Weights of
                                  Extremal Self-Dual Codes . . . . . . . . 15--36
    István Kovács   On the Internal Nuclei of Sets in ${\rm
                                  PG}(n,q)$, $q$ is Odd  . . . . . . . . . 37--42
                    Chris Boner   Maximal Weight Divisors of Projective
                                  Reed--Muller Codes . . . . . . . . . . . 43--47
               Siaw-Lynn Ng and   
                 Michael Walker   On the Composition of Matroids and Ideal
                                  Secret Sharing Schemes . . . . . . . . . 49--67
                      D. Wu and   
                         L. Zhu   Generalized Steiner Systems with a Prime
                                  Power  . . . . . . . . . . . . . . . . . 69--80
                P. Véron   True Dimension of Some Binary Quadratic
                                  Trace Goppa Codes  . . . . . . . . . . . 81--97
              Gabriele Nebe and   
                E. M. Rains and   
                N. J. A. Sloane   The Invariants of the Clifford Groups    99--122

Designs, Codes, and Cryptography
Volume 24, Number 2, October, 2001

                  Martin Bokler   Minimal Blocking Sets in Projective
                                  Spaces of Square Order . . . . . . . . . 131--144
           Amir K. Khandani and   
                    M. Esmaeili   Successive Minimization of the State
                                  Complexity of the Self-dual Lattices
                                  Using Korkin-Zolotarev Reduced Basis . . 145--158
              Sönke Blunck   On the Existence and Construction of
                                  Tight Fourth Order Quadrature Rules for
                                  the Sphere . . . . . . . . . . . . . . . 159--169
                      A. Baliga   Cocyclic Codes of Length $40$  . . . . . 171--179
               Kwok Yan Lam and   
                 Francesco Sica   The Weight Distribution of . . . . . . . 181--191
               Iiro Honkala and   
              Tero Laihonen and   
                    Sanna Ranto   On Codes Identifying Sets of Vertices in
                                  Hamming Spaces . . . . . . . . . . . . . 193--204
                Simeon Ball and   
                   Ray Hill and   
               Ivan Landjev and   
                    Harold Ward   On $(q^2 + q + 2, q + 2)$-arcs in the
                                  Projective Plane . . . . . . . . . . . . 205--224
             Zvonimir Janko and   
            Hadi Kharaghani and   
            Vladimir D. Tonchev   The Existence of a Bush-Type Hadamard
                                  Matrix of Order $324$ and Two New
                                  Infinite Classes of Symmetric Designs    225--232
                 E. Ballico and   
                  A. Cossidente   Curves in Projective Spaces and Almost
                                  MDS Codes  . . . . . . . . . . . . . . . 233--237

Designs, Codes, and Cryptography
Volume 24, Number 3, December, 2001

              Mariko Hagita and   
               Bernhard Schmidt   Bijections Between Group Rings
                                  Preserving Character Sums  . . . . . . . 243--254
               Carlo Blundo and   
          Annalisa De Bonis and   
              Alfredo De Santis   Improved Schemes for Visual Cryptography 255--278
        Igor E. Shparlinski and   
            Joseph H. Silverman   On the Linear Complexity of the
                                  Naor--Reingold Pseudo-random Function
                                  from Elliptic Curves . . . . . . . . . . 279--289
                Clement Lam and   
                      Ying Miao   Difference Families  . . . . . . . . . . 291--304
          H. Tapia-Recillas and   
                        G. Vega   An Upper Bound on the Number of
                                  Iterations for Transforming a Boolean
                                  Function of Degree Greater or Equal Than
                                  $4$ to a Function of Degree $3$  . . . . 305--312
                  Nuh Aydin and   
                 Irfan Siap and   
         Dijen K. Ray-Chaudhuri   The Structure of $1$-Generator
                                  Quasi-Twisted Codes and New Linear Codes 313--326
                      Wenbo Mao   Verifiable Partial Escrow of Integer
                                  Factors  . . . . . . . . . . . . . . . . 327--342
             Jeong-Heon Kim and   
                 Hong-Yeop Song   Trace Representation of Legendre
                                  Sequences  . . . . . . . . . . . . . . . 343--348


Designs, Codes, and Cryptography
Volume 25, Number 1, January, 2002

             Stefka Bouyuklieva   On the Automorphisms of Order $2$ with
                                  Fixed Points for the Extremal Self-Dual
                                  Codes of Length  . . . . . . . . . . . . 5--13
            Philip A. Eisen and   
             Douglas R. Stinson   Threshold Visual Cryptography Schemes
                                  with Specified Whiteness Levels of
                                  Reconstructed Pixels . . . . . . . . . . 15--61
                 Arne Winterhof   Polynomial Interpolation of the Discrete
                                  Logarithm  . . . . . . . . . . . . . . . 63--72
              Etsuko Bannai and   
               Mitsuhiro Sawano   Symmetric Designs Attached to
                                  Four-Weight Spin Models  . . . . . . . . 73--90
                D. Brozovic and   
                      C. Ho and   
                    A. Munemasa   A Correction to ``Incidence Matrices and
                                  Collineations of Finite Projective
                                  Planes'' by Chat Yin Ho, Designs, Codes
                                  and Cryptography, 18 (1999), 159--162    91--93
               T. Blackmore and   
                   G. H. Norton   Lower Bounds on the State Complexity of
                                  Geometric Goppa Codes  . . . . . . . . . 95--115

Designs, Codes, and Cryptography
Volume 25, Number 2, February, 2002

                K. T. Arasu and   
          Warwick de Launey and   
                       S. L. Ma   On Circulant Complex Hadamard Matrices   123--142
                  S. Ferret and   
                      L. Storme   Minihypers and Linear Codes Meeting the
                                  Griesmer Bound: Improvements to Results
                                  of Hamada, Helleseth and Maekawa . . . . 143--162
           Stelios Georgiou and   
             Masaaki Harada and   
           Christos Koukouvinos   Orthogonal Designs and Type II Codes
                                  over $\mathbb{Z}_{2k}$ . . . . . . . . . 163--174
             Sergio Cabello and   
        Carles Padró and   
      Germán Sáez   Secret Sharing Schemes with Detection of
                                  Cheaters for a General Access Structure  175--188
         Jürgen Bierbrauer   The Theory of Cyclic Codes and a
                                  Generalization to Additive Codes . . . . 189--206
             Jorge Guajardo and   
                  Christof Paar   Itoh-Tsujii Inversion in Standard Basis
                                  and Its Application in Cryptography and
                                  Codes  . . . . . . . . . . . . . . . . . 207--216

Designs, Codes, and Cryptography
Volume 25, Number 3, March, 2002

               Ingrid Biehl and   
          Johannes Buchmann and   
               Safuat Hamdy and   
                  Andreas Meyer   A Signature Scheme Based on the
                                  Intractability of Computing Roots  . . . 223--236
          Massimo Giulietti and   
         Fernanda Pambianco and   
            Fernando Torres and   
                  Emanuela Ughi   On Complete Arcs Arising from Plane
                                  Curves . . . . . . . . . . . . . . . . . 237--246
                      Koen Thas   A Theorem Concerning Nets Arising from
                                  Generalized Quadrangles with a Regular
                                  Point  . . . . . . . . . . . . . . . . . 247--253
       Luis Martínez and   
      Antonio Vera-López   Ring-Valued Assignments to the Points of
                                  a $t$-Design . . . . . . . . . . . . . . 255--262
                  C. Carlet and   
                 Yu. Tarannikov   Covering Sequences of Boolean Functions
                                  and Their Cryptographic Significance . . 263--279
        Carles Padró and   
             Ignacio Gracia and   
Sebasti\`a Martín Molleví and   
                    Paz Morillo   Linear Key Predistribution Schemes . . . 281--298
                John B. Polhill   Constructions of Nested Partial
                                  Difference Sets with Galois Rings  . . . 299--309
            Edoardo Ballico and   
             Antonio Cossidente   Hermitian Veronesean Schemes . . . . . . 311--317


Designs, Codes, and Cryptography
Volume 26, Number 1--3, June / July / August, 2002

        Charles J. Colbourn and   
         Douglas R. Stinson and   
            G. H. John van Rees   Preface: In Honour of Ronald C. Mullin   5--6
          R. Julian R. Abel and   
              F. E. Bennett and   
                          G. Ge   The Existence of Four HMOLS with Equal
                                  Sized Holes  . . . . . . . . . . . . . . 7--31
          R. Julian R. Abel and   
              Iliya Bluskov and   
                  Malcolm Greig   Balanced Incomplete Block Designs with
                                  Block Size $9$ and $\lambda=2,4,8$ . . . 33--59
               R. T. Bilous and   
              G. H. J. van Rees   An Enumeration of Binary Self-Dual Codes
                                  of Length $32$ . . . . . . . . . . . . . 61--86
               Ian F. Blake and   
         Theodoulos Garefalakis   On the Security of the Digital Signature
                                  Algorithm  . . . . . . . . . . . . . . . 87--96
                  C. Blundo and   
                 B. Masucci and   
              D. R. Stinson and   
                         R. Wei   Constructions and Bounds for
                                  Unconditionally Secure Non-Interactive
                                  Commitment Schemes . . . . . . . . . . . 97--110
                  Marco Buratti   Cyclic Designs with Block Size $4$ and
                                  Related Optimal Optical Orthogonal Codes 111--125
                     H. Cao and   
                         L. Zhu   Kirkman Packing Designs KPD$(3, 5*,v)$   127--138
              Chris Charnes and   
       Martin Rötteler and   
                    Thomas Beth   Homogeneous Bent Functions, Invariants,
                                  and Designs  . . . . . . . . . . . . . . 139--154
               Yanxun Chang and   
                      Ying Miao   General Constructions for Double Group
                                  Divisible Designs and Double Frames  . . 155--168
        Charles J. Colbourn and   
               E. R. Lamken and   
            Alan C. H. Ling and   
                    W. H. Mills   The Existence of Kirkman Squares ---
                                  Doubly Resolvable $(v,3,1)$-BIBDs  . . . 169--196
                  Peng Ding and   
                Jennifer D. Key   Subcodes of the Projective Generalized
                                  Reed--Muller Codes Spanned by
                                  Minimum-Weight Vectors . . . . . . . . . 197--211
   Marialuisa J. de Resmini and   
              Dina Ghinelli and   
              Dieter Jungnickel   Arcs and Ovals from Abelian Groups . . . 213--228
             Michael Drmota and   
                 Daniel Panario   A Rigorous Proof of the Waterloo
                                  Algorithm for the Discrete Logarithm
                                  Problem  . . . . . . . . . . . . . . . . 229--241
                  F. Franek and   
             M. J. Grannell and   
               T. S. Griggs and   
                        A. Rosa   On Large Sets of $v-1$ L-Intersecting
                                  Steiner Triple Systems of Order $v$  . . 243--256
             Ryoh Fuji-Hara and   
                      Ying Miao   A Note on Geometric Structures of Linear
                                  Ordered Orthogonal Arrays and
                                  (T,M,S)-Nets of Low Strength . . . . . . 257--263


Designs, Codes, and Cryptography
Volume 27, Number 1--2, October / November, 2002

                      G. Ge and   
                     R. S. Rees   On Group-Divisible Designs with Block
                                  Size Four and Group-Type gum1  . . . . . 5--24
                  Malcolm Greig   Finite Linear Spaces II  . . . . . . . . 25--47
 Hans-Dietrich O. F. Gronau and   
Martin Grüttmüller and   
              Sven Hartmann and   
                   Uwe Leck and   
                    Volker Leck   On Orthogonal Double Covers of Graphs    49--91
             M. J. Jacobson and   
                        Jr. and   
                 H. C. Williams   Modular Arithmetic on Elements of Small
                                  Norm in Quadratic Fields . . . . . . . . 93--110
                Clement Lam and   
            Vladimir D. Tonchev   A New Bound on the Number of Designs
                                  with Classical Affine Parameters . . . . 111--117
              Rudolf Mathon and   
            Anne Penfold Street   Partitioning Sets of Triples into Small
                                  Planes . . . . . . . . . . . . . . . . . 119--130
Patric R. J. Östergård and   
                  Petteri Kaski   Enumeration of $2-(9, 3, \lambda)$
                                  Designs and Their Resolutions  . . . . . 131--137
            Kevin T. Phelps and   
             Merc\`e Villanueva   Ranks of $q$-Ary $1$-Perfect Codes . . . 139--144
              Nabil Shalaby and   
               Jianmin Wang and   
                   Jianxing Yin   Existence of Perfect
                                  $4$-Deletion-Correcting Codes with
                                  Length Six . . . . . . . . . . . . . . . 145--156
            Gustavus J. Simmons   Parity Encoding of Binary Sequences  . . 157--164
              Brett Stevens and   
                Eric Mendelsohn   Packing Arrays and Packing Designs . . . 165--176

Designs, Codes, and Cryptography
Volume 27, Number 3, December, 2002

            Kevin T. Phelps and   
             Merc\`e Villanueva   On Perfect Codes: Rank and Kernel  . . . 183--194
                 Vikram Jha and   
              Norman L. Johnson   Transversal-Free Translation Nets  . . . 195--205
             Wen-Guey Tzeng and   
                    Chi-Ming Hu   A New Approach for Visual Cryptography   207--227
                  S. Murphy and   
               M. J. B. Robshaw   Key-Dependent S-Boxes and Differential
                                  Cryptanalysis  . . . . . . . . . . . . . 229--255
Patric R. J. Östergård   A $2-(22, 8, 4)$ Design Cannot Have a
                                  $2-(10, 4, 4)$ Subdesign . . . . . . . . 257--260
               A. Ashikhmin and   
                        A. Barg   Bounds on the Covering Radius of Linear
                                  Codes  . . . . . . . . . . . . . . . . . 261--269
                Fang-Wei Fu and   
               Victor K.-W. Wei   Self-Complementary Balanced Codes and
                                  Quasi-Symmetric Designs  . . . . . . . . 271--279
              K. J. Horadam and   
                       P. Udaya   A New Construction of Central Relative
                                  $(p^a, p^a, p^a, 1)$-Difference Sets . . 281--295
Patric R. J. Östergård   Classifying Subspaces of Hamming Spaces  297--305


Designs, Codes, and Cryptography
Volume 28, Number 1, January, 2003

          David Pointcheval and   
              Guillaume Poupard   A New \mathcalNP-Complete Problem and
                                  Public-Key Identification  . . . . . . . 5--31
          Simon Joseph Agou and   
      Marc Deléglise and   
             Jean-Louis Nicolas   Short Polynomial Representations for
                                  Square Roots Modulo $p$  . . . . . . . . 33--44
             Emily H. Moore and   
              Harriet Pollatsek   Looking for Difference Sets in Groups
                                  with Dihedral Images . . . . . . . . . . 45--50
                P. Govaerts and   
                      L. Storme   On a Particular Class of Minihypers and
                                  Its Applications. I. The Result for
                                  General $q$  . . . . . . . . . . . . . . 51--63
              V. Abatangelo and   
                      B. Larato   Doubly $\beta$-Derived Translation
                                  Planes . . . . . . . . . . . . . . . . . 65--74
                K. T. Arasu and   
                Kevin J. Player   A New Family of Cyclic Difference Sets
                                  with Singer Parameters in Characteristic
                                  Three  . . . . . . . . . . . . . . . . . 75--91
                 Xiang-dong Hou   On Binary Resilient Functions  . . . . . 93--112

Designs, Codes, and Cryptography
Volume 28, Number 2, March, 2003

                 Laurie Law and   
             Alfred Menezes and   
                 Minghua Qu and   
              Jerry Solinas and   
                 Scott Vanstone   An Efficient Protocol for Authenticated
                                  Key Agreement  . . . . . . . . . . . . . 119--134
            Sergei Konyagin and   
                Tanja Lange and   
               Igor Shparlinski   Linear Complexity of the Discrete
                                  Logarithm  . . . . . . . . . . . . . . . 135--146
               V. C. Mavron and   
            T. P. McDonough and   
               M. S. Shrikhande   Quasi-Symmetric Designs with Good Blocks
                                  and Intersection Number One  . . . . . . 147--162
         Stefka Bouyuklieva and   
                 Masaaki Harada   Extremal Self-Dual $[50, 25, 10]$ Codes
                                  with Automorphisms of Order $3$ and
                                  Quasi-Symmetric $2-(49, 9, 6)$ Designs   163--169
           Koichi Betsumiya and   
          T. Aaron Gulliver and   
                 Masaaki Harada   Extremal Self-Dual Codes over
                                  $\mathbb{F}_2 \times \mathbb{F}_2$ . . . 171--186
                Sheng-bo Xu and   
              Jeroen Doumen and   
               Henk van Tilborg   On the Security of Digital Signature
                                  Schemes Based on Error-Correcting Codes  187--199
              Svetla Nikova and   
               Ventzislav Nikov   Improvement of the Delsarte Bound for
                                  $\theta$-Designs When It Is Not the Best
                                  Bound Possible . . . . . . . . . . . . . 201--222

Designs, Codes, and Cryptography
Volume 28, Number 3, April, 2003

             Mida Guillermo and   
            Keith M. Martin and   
           Christine M. O'Keefe   Providing Anonymity in Unconditionally
                                  Secure Secret Sharing Schemes  . . . . . 227--245
             Dong-Joon Shin and   
             P. Vijay Kumar and   
                  Tor Helleseth   $3$-Designs from the $Z_4$-Goethals
                                  Codes via a New Kloosterman Sum Identity 247--263
              Tor Helleseth and   
       Torleiv Klòve and   
        Vladimir I. Levenshtein   Hypercubic $4$ and $5$-Designs from
                                  Double-Error-Correcting BCH Codes  . . . 265--282
                   David Masson   Designs and Representation of the
                                  Symmetric Group  . . . . . . . . . . . . 283--302
                    Klaus Huber   Taking $p$th Roots Modulo Polynomials
                                  over Finite Fields . . . . . . . . . . . 303--311


Designs, Codes, and Cryptography
Volume 29, Number 1--3, May / June / July, 2003

                A. Blokhuis and   
        J. W. P. Hirschfeld and   
              D. Jungnickel and   
                     J. A. Thas   Finite Geometries  . . . . . . . . . . . 5--5
                 A. Aguglia and   
              A. Cossidente and   
                    G. L. Ebert   Complete Spans on Hermitian Varieties    7--15
                R. Ahlswede and   
                H. Aydinian and   
              L. H. Khachatrian   Forbidden $(0,1)$-Vectors in Hyperplanes
                                  of $\mathbb{R}^n$: The Restricted Case   17--28
            Rudolf Ahlswede and   
              Levon Khachatrian   Cone Dependence---A Basic Combinatorial
                                  Concept  . . . . . . . . . . . . . . . . 29--40
                Laura Bader and   
             Nicola Durante and   
                  Maska Law and   
         Guglielmo Lunardon and   
                   Tim Penttila   Symmetries of BLT-Sets . . . . . . . . . 41--50
                Thomas Beth and   
        Christopher Charnes and   
              Markus Grassl and   
               Gernot Alber and   
               Aldo Delgado and   
              Michael Mussinger   A New Class of Designs Which Protect
                                  against Quantum Jumps  . . . . . . . . . 51--70
     Jürgen Bierbrauer and   
          Stefano Marcugini and   
             Fernanda Pambianco   Projective Planes, Coverings and a
                                  Network Problem  . . . . . . . . . . . . 71--89
              Aart Blokhuis and   
 Tamás Sz[odblac]nyi and   
                  Zsuzsa Weiner   On Sets without Tangents in Galois
                                  Planes of Even Order . . . . . . . . . . 91--98
                  Yves Edel and   
         Jürgen Bierbrauer   The Largest Cap in AG$(4, 4)$ and Its
                                  Uniqueness . . . . . . . . . . . . . . . 99--104
                  S. Ferret and   
                      L. Storme   Results on Maximal Partial Spreads in
                                  PG$(3, p^3)$ and on Related Minihypers   105--122
  András Gács and   
     Tamás Sz[odblac]nyi   On Maximal Partial Spreads in PG$(n, q)$ 123--129
  András Gács and   
                  Zsuzsa Weiner   On $(q + t, t)$-Arcs of Type $(0, 2, t)$ 131--139
                P. Govaerts and   
              D. Jungnickel and   
                  L. Storme and   
                     J. A. Thas   Some New Maximal Sets of Mutually
                                  Orthogonal Latin Squares . . . . . . . . 141--147
        Gohar M. Kyureghyan and   
                 Alexander Pott   On the Linear Complexity of the
                                  Sidelnikov-Lempel-Cohn-Eastman Sequences 149--164
                 I. Landjev and   
                A. Rousseva and   
                  T. Maruta and   
                        R. Hill   On Optimal Codes Over the Field with
                                  Five Elements  . . . . . . . . . . . . . 165--175
                Dimitri Leemans   The Residually Weakly Primitive
                                  Geometries of M$_{22}$ . . . . . . . . . 177--178
                  D. Luyckx and   
                     J. A. Thas   On $1$-Systems of Q$(6, q)$, $q$ Even    179--197
          Hendrik van Maldeghem   Some Remarks on Steiner Systems  . . . . 199--213
                   Klaus Metsch   On the Characterization of the Folded
                                  Halved Cubes by Their Intersection
                                  Arrays . . . . . . . . . . . . . . . . . 215--225
                      Koen Thas   Symmetry in Generalized Quadrangles  . . 227--245
            Vladimir D. Tonchev   A Note on MDS Codes, $n$-Arcs and
                                  Complete Designs . . . . . . . . . . . . 247--250


Designs, Codes, and Cryptography
Volume 30, Number 1, August, 2003

                   Siaw-Lynn Ng   A Representation of a Family of Secret
                                  Sharing Matroids . . . . . . . . . . . . 5--19
            Maria Axenovich and   
      Zoltán Füredi   Exact Bounds on the Sizes of Covering
                                  Codes  . . . . . . . . . . . . . . . . . 21--38
                Shengli Liu and   
     Henk C. A. Van Tilborg and   
                Marten Van Dijk   A Practical Protocol for Advantage
                                  Distillation and Information
                                  Reconciliation . . . . . . . . . . . . . 39--62
             Keith E. Mellinger   A Geometric Relationship Between
                                  Equivalent Spreads . . . . . . . . . . . 63--71
              Cunsheng Ding and   
             Mordecai Golin and   
           Torleiv Klòve   Meeting the Welch and Karystinos-Pados
                                  Bounds on DS-CDMA Binary Signature Sets  73--84
              Antonia W. Bluher   On $x^6 + x + a$ in Characteristic Three 85--95
           Iliya Bouyukliev and   
                Juriaan Simonis   Some New Results on Optimal Codes Over
                                  $F^5$  . . . . . . . . . . . . . . . . . 97--111
                   San Ling and   
            Patrick Solé   On the Algebraic Structure of
                                  Quasi-cyclic Codes II: Chain Rings . . . 113--130

Designs, Codes, and Cryptography
Volume 30, Number 2, September, 2003

                  H. Kharaghani   On a Class of Symmetric Balanced
                                  Generalized Weighing Matrices  . . . . . 139--149
                Daniel B. Dalan   New Extremal Type I Codes of Lengths
                                  $40$, $42$, and $44$ . . . . . . . . . . 151--157
              Massimiliano Sala   Upper Bounds on the Dual Distance of
                                  BCH$(255, k)$  . . . . . . . . . . . . . 159--168
               Kenichiro Tanabe   A Criterion for Designs in $Z_4$-codes
                                  on the Symmetrized Weight Enumerator . . 169--185
               Jon-Lark Kim and   
                     Vera Pless   Designs in Additive Codes over GF$(4)$   187--199
            Phong Q. Nguyen and   
            Igor E. Shparlinski   The Insecurity of the Elliptic Curve
                                  Digital Signature Algorithm with
                                  Partially Known Nonces . . . . . . . . . 201--217
               I. Cardinali and   
               O. Polverino and   
                   R. Trombetti   On the Sporadic Semifield Flock  . . . . 219--226

Designs, Codes, and Cryptography
Volume 30, Number 3, November, 2003

              Palash Sarkar and   
           Paul J. Schellenberg   Construction of Symmetric Balanced
                                  Squares with Blocksize More than One . . 235--280
       Detlef Hühnlein and   
        Michael J. Jacobson and   
                        Jr. and   
                   Damian Weber   Towards Practical Non-Interactive
                                  Public-Key Cryptosystems Using
                                  Non-Maximal Imaginary Quadratic Orders   281--299
              Ederlina G. Nocon   On the Construction of Some Type II
                                  Codes over $Z_4 \times Z_4$  . . . . . . 301--323
          David B. Chandler and   
                     Qing Xiang   Cyclic Relative Difference Sets and
                                  their $p$-Ranks  . . . . . . . . . . . . 325--343


Designs, Codes, and Cryptography
Volume 31, Number 1, January, 2004

                      Yves Edel   Extensions of Generalized Product Caps   5--14
            J. Barát and   
                 A. Del Fra and   
              S. Innamorati and   
                      L. Storme   Minimal Blocking Sets in PG$(2, 8)$ and
                                  Maximal Partial Spreads in PG$(3, 8)$    15--26
           Hans Georg Schaathun   A Lower Bound on the Greedy Weights of
                                  Product Codes  . . . . . . . . . . . . . 27--42
                 David G. Glynn   On the Orthogonality of Geometric Codes  43--50
          Jovan DJ. Goli\'c and   
               Renato Menicocci   Correlation Analysis of the Alternating
                                  Step Generator . . . . . . . . . . . . . 51--74
             Dong-Joon Shin and   
             P. Vijay Kumar and   
                  Tor Helleseth   An Assmus--Mattson-Type Approach for
                                  Identifying $3$-Designs from Linear
                                  Codes over Z$_4$ . . . . . . . . . . . . 75--92

Designs, Codes, and Cryptography
Volume 31, Number 2, February, 2004

               Ingrid Biehl and   
              Sacher Paulus and   
                Tsuyoshi Takagi   Efficient Undeniable Signature Schemes
                                  Based on Ideal Arithmetic in Quadratic
                                  Orders . . . . . . . . . . . . . . . . . 99--123
             Tran van Trung and   
             Sosina Martirosyan   On a Class of Traceability Codes . . . . 125--132
                  S. Rajola and   
             M. Scafati Tallini   Affine Planes and Flag Linear Spaces . . 133--137
          T. Aaron Gulliver and   
                 Masaaki Harada   On the Minimum Weight of Codes over
                                  $F_5$ Constructed from Certain
                                  Conference Matrices  . . . . . . . . . . 139--145
     Pantelimon St\uanic\ua and   
                   Soo Hak Sung   Boolean Functions with Five Controllable
                                  Cryptographic Properties . . . . . . . . 147--157
                   U. Dempwolff   Affine Rank $3$ Groups on Symmetric
                                  Designs  . . . . . . . . . . . . . . . . 159--168
          Michael E. O'Sullivan   On Koetter's Algorithm and the
                                  Computation of Error Values  . . . . . . 169--188

Designs, Codes, and Cryptography
Volume 31, Number 3, March, 2004

             David A. Drake and   
                  Kevin Keating   Ovals and Hyperovals in Desarguesian
                                  Nets . . . . . . . . . . . . . . . . . . 195--212
                      Peter Sin   The $p$-Rank of the Incidence Matrix of
                                  Intersecting Linear Subspaces  . . . . . 213--220
                  Andreas Klein   Partial Ovoids in Classical Finite Polar
                                  Spaces . . . . . . . . . . . . . . . . . 221--226
             Andrew Klapper and   
                    Jinzhong Xu   Register Synthesis for Algebraic
                                  Feedback Shift Registers Based on
                                  Non-Primes . . . . . . . . . . . . . . . 227--250
           Matthew R. Brown and   
       Christine M. O'Keefe and   
                S. E. Payne and   
               Tim Penttila and   
                Gordon F. Royle   Spreads of $T_2(o)$, $\alpha$-flocks and
                                  Ovals  . . . . . . . . . . . . . . . . . 251--282
                   Klaus Metsch   Small Point Sets that Meet All
                                  Generators of $W(2 n +1, q)$ . . . . . . 283--288
                 Gloria Rinaldi   Key Distribution Patterns Using Tangent
                                  Circle Structures  . . . . . . . . . . . 289--300
             Siguna Müller   On the Computation of Square Roots in
                                  Finite Fields  . . . . . . . . . . . . . 301--312
    Sergey V. Avgustinovich and   
                 Olof Heden and   
             Faina I. Solov'eva   The Classification of Some Perfect Codes 313--318


Designs, Codes, and Cryptography
Volume 32, Number 1--3, May / July, 2004

                      Anonymous   Preface  . . . . . . . . . . . . . . . . 5--6
                      Anonymous   List of Participants . . . . . . . . . . 7--8
                Simeon Ball and   
               John Bamberg and   
             Michel Lavrauw and   
                   Tim Penttila   Symplectic Spreads . . . . . . . . . . . 9--14
               Carlo Blundo and   
               Paolo D'Arco and   
          Alfredo De Santis and   
             Massimiliano Listo   Design of Self-Healing Key Distribution
                                  Schemes  . . . . . . . . . . . . . . . . 15--44
              Julia M. N. Brown   On the Action of the Groups
                                  $\mbox{GL}(n+1,q)$, $\mbox{PGL}(n + 1,
                                  q)$, $\mbox{SL}(n + 1, q)$ and
                                  $\mbox{PSL}(n + 1, q)$ on $\mbox{PG}(n,
                                  q^t)$  . . . . . . . . . . . . . . . . . 45--50
                Wensong Chu and   
        Charles J. Colbourn and   
                    Peter Dukes   Constructions for Permutation Codes in
                                  Powerline Communications . . . . . . . . 51--64
        Charles J. Colbourn and   
            Alan C. H. Ling and   
             Violet R. Syrotiuk   Cover-Free Families and
                                  Topology-Transparent Scheduling for
                                  MANETs . . . . . . . . . . . . . . . . . 65--95
              A. Cossidente and   
               M. J. de Resmini   Remarks on Singer Cyclic Groups and
                                  Their Normalizers  . . . . . . . . . . . 97--102
               F. De Clerck and   
                    M. Delanote   On $(0,\alpha)$-Geometries and Dual
                                  Semipartial Geometries Fully Embedded in
                                  an Affine Space  . . . . . . . . . . . . 103--110
               Nikias de Feyter   Planar Oval Sets in Desarguesian Planes
                                  of Even Order  . . . . . . . . . . . . . 111--119
                    D. Deng and   
              D. R. Stinson and   
                         R. WEI   The Lovász Local Lemma and Its
                                  Applications to some Combinatorial
                                  Arrays . . . . . . . . . . . . . . . . . 121--134
               A. De Santis and   
                     B. Masucci   Anonymous Membership Broadcast Schemes   135--151
               S. De Winter and   
                     J. A. Thas   SPG-Reguli Satisfying the Polar Property
                                  and a New Semipartial Geometry . . . . . 153--166
             David A. Drake and   
                  Wendy Myrvold   Nets of Small Degree Without Ovals . . . 167--183
                  Z. Eslami and   
         G. B. Khosrovshahi and   
                    M. M. Noori   Enumeration of $t$-Designs Through
                                  Intersection Matrices  . . . . . . . . . 185--191
                S. Georgiou and   
                 C. Koukouvinos   Self-Orthogonal and Self-Dual Codes
                                  Constructed via Combinatorial Designs
                                  and Diophantine Equations  . . . . . . . 193--206
M. I. González Vasco and   
                D. Hofheinz and   
         C. Martínez and   
                  R. Steinwandt   On the Security of Two Public Key
                                  Cryptosystems Using Non-Abelian Groups   207--216
            Otokar Gro\vsek and   
         Peter Horák and   
                 Tran van Trung   On Non-Polynomial Latin Squares  . . . . 217--226
                  Yury J. Ionin   Regular Hadamard Matrices Generating
                                  Infinite Families of Symmetric Designs   227--233
         G. B. Khosrovshahi and   
               B. Tayfeh-Rezaie   Some Indecomposable $t$-Designs  . . . . 235--238
       G. Korchmáros and   
                     A. Sonnino   Hyperbolic Ovals in Finite Planes  . . . 239--249
Selda Kücçükcçìfcçì and   
                  C. C. Lindner   Minimum Covering for Hexagon Triple
                                  Systems  . . . . . . . . . . . . . . . . 251--265
               Domenico Labbate   Amalgams of Cubic Bipartite Graphs . . . 267--275
                  Reinhard Laue   Resolvable $t$-Designs . . . . . . . . . 277--301
                      X. Ma and   
                         R. Wei   On a Bound of Cover-Free Families  . . . 303--321
         Sosina Martirosyan and   
                 Tran van Trung   On $t$-Covering Arrays . . . . . . . . . 323--339
             Keith E. Mellinger   LDPC Codes from Triangle-Free Line Sets  341--350
                 Alan Offer and   
          Hendrik Van Maldeghem   Spreads and Ovoids Translation with
                                  Respect to Disjoint Flags  . . . . . . . 351--367
            Tanya E. Seidel and   
               Daniel Socek and   
                  Michal Sramka   Parallel Symmetric Attack on NTRU using
                                  Non-Deterministic Lattice Reduction  . . 369--379
                    R. Shaw and   
                   N. A. Gordon   The Quintic Grassmannian $G_{1, 4, 2}$
                                  in $\mbox{PG}(9, 2)$ . . . . . . . . . . 381--396


Designs, Codes, and Cryptography
Volume 33, Number 1, August, 2004

  János Barát and   
                     Leo Storme   Multiple Blocking Sets in
                                  $\mbox{PG}(n,q), n > 3$ . . . . . . . . . 5--21
               Jong-Seon No and   
             Dong-Joon Shin and   
                  Tor Helleseth   On the $p$-Ranks and Characteristic
                                  Polynomials of Cyclic Difference Sets    23--37
              Tor Helleseth and   
           Johannes Mykkeltveit   A Proof of Simmons' Conjecture . . . . . 39--43
        Steven T. Dougherty and   
              Keisuke Shiromoto   Maximum Distance Codes in
                                  $\mbox{Mat}_{n,s} (Z_k)$ with a
                                  Non-Hamming Metric and Uniform
                                  Distributions  . . . . . . . . . . . . . 45--61
             David A. Drake and   
                  Wendy Myrvold   The Non-Existence of Maximal Sets of
                                  Four Mutually Orthogonal Latin Squares
                                  of Order $8$ . . . . . . . . . . . . . . 63--69
                 Harold N. Ward   A Sequence of Unique Quaternary Griesmer
                                  Codes  . . . . . . . . . . . . . . . . . 71--85

Designs, Codes, and Cryptography
Volume 33, Number 2, September, 2004

Conchita Martínez-Pérez and   
               Wolfgang Willems   On the Weight Hierarchy of Product Codes 95--108
                 Wilfried Meidl   How Many Bits have to be Changed to
                                  Decrease the Linear Complexity?  . . . . 109--122
               Mark Goresky and   
                 Andrew Klapper   Periodicity and Correlation Properties
                                  of $d$-FCSR Sequences  . . . . . . . . . 123--148
             Masaaki Harada and   
               Michio Ozeki and   
               Kenichiro Tanabe   On the Covering Radius of Ternary
                                  Extremal Self-Dual Codes . . . . . . . . 149--158
                   J. L. Hayden   Eigenvalues of Finite Projective Planes
                                  with an Abelian Cartesian Group  . . . . 159--172
               Lucio Guerra and   
                  Rita Vincenti   On the Linear Codes Arising from
                                  Schubert Varieties . . . . . . . . . . . 173--180

Designs, Codes, and Cryptography
Volume 33, Number 3, November, 2004

          Wiebke S. Diestelkamp   Parameter Inequalities for Orthogonal
                                  Arrays with Mixed Levels . . . . . . . . 187--197
                   Jong-Seon No   New Cyclic Difference Sets with Singer
                                  Parameters Constructed from
                                  $d$-Homogeneous Functions  . . . . . . . 199--213
María Isabel González Vasco and   
   Consuelo Martínez and   
              Rainer Steinwandt   Towards a Uniform Description of Several
                                  Group Based Cryptographic Primitives . . 215--226
              Cunsheng Ding and   
                  Xiaojian Tian   Three Constructions of Authentication
                                  Codes with Perfect Secrecy . . . . . . . 227--239
               Carlo Blundo and   
   Sebasti\`a Martín and   
            Barbara Masucci and   
            CarlEs Padró   A Linear Algebraic Approach to Metering
                                  Schemes  . . . . . . . . . . . . . . . . 241--260
             Alfred Menezes and   
                    Nigel Smart   Security of Signature Schemes in a
                                  Multi-User Setting . . . . . . . . . . . 261--274
            Joseph L. Yucas and   
                 Gary L. Mullen   Self-Reciprocal Irreducible Polynomials
                                  Over Finite Fields . . . . . . . . . . . 275--281


Designs, Codes, and Cryptography
Volume 34, Number 1, January, 2005

             Tatsuya Maruta and   
            Ivan N. Landjev and   
                 Assya Rousseva   On the Minimum Size of Some Minihypers
                                  and Related Linear Codes . . . . . . . . 5--15
Jaume Martí-Farré and   
            Carles Padró   Secret Sharing Schemes with Three or
                                  Four Minimal Qualified Subsets . . . . . 17--34
            Ferruh Özbudak   Elements of Prescribed Order, Prescribed
                                  Traces and Systems of Rational Functions
                                  Over Finite Fields . . . . . . . . . . . 35--54
              Michael Braun and   
            Adalbert Kerber and   
                  Reinhard Laue   Systematic Construction of $q$-Analogs
                                  of $t-(v, k,\lambda)$-Designs  . . . . . 55--70
             Masaaki Harada and   
                Clement Lam and   
            Vladimir D. Tonchev   Symmetric $(4,4)$-Nets and Generalized
                                  Hadamard Matrices Over Groups of Order
                                  $4$  . . . . . . . . . . . . . . . . . . 71--87
           Bikash Kumar Dey and   
                B. Sundar Rajan   $F_q$-linear Cyclic Codes over $F^m_q$:
                                  DFT Approach . . . . . . . . . . . . . . 89--116
                 Gennian Ge and   
                Alan C. H. Ling   Group Divisible Designs with Block Size
                                  Four and Group Type $g^u m^1$ with
                                  Minimum $m$  . . . . . . . . . . . . . . 117--126

Designs, Codes, and Cryptography
Volume 34, Number 2--3, February, 2005

              Aart Blokhuis and   
                 Willem Haemers   Preface  . . . . . . . . . . . . . . . . 135--135
               Edwin R. Van Dam   The Combinatorics of Dom de Caen . . . . 137--148
                 D. De Caen and   
              D. Fon-Der-Flaass   Distance Regular Covers of Complete
                                  Graphs from Latin Squares  . . . . . . . 149--153
                K. Coolsaet and   
                     J. Degraer   A Computer-Assisted Proof of the
                                  Uniqueness of the Perkel Graph . . . . . 155--171
               Bang Sejeong and   
                   J. H. Koolen   Some Interlacing Results for the
                                  Eigenvalues of Distance-regular graphs   173--186
                       Hirasaka   On Meta-Thin Association Schemes . . . . 187--201
                   Ron Shaw and   
           Johannes G. Maks and   
                 Neil A. Gordon   The Classification of Flats in which are
                                  External to the Grassmannian . . . . . . 203--227
         Dragos Cvetkovi\'c and   
            Peter Rowlinson and   
            Slobodan K. Simi\'c   Graphs With Least Eigenvalue $-2$: A New
                                  Proof of the $31$ Forbidden Subgraphs
                                  Theorem  . . . . . . . . . . . . . . . . 229--240
                   Brian Curtin   Algebraic Characterizations of Graph
                                  Regularity Conditions  . . . . . . . . . 241--248
           Mikhail Muzychuk and   
    István Kovács   A Solution of a Problem of A. E. Brouwer 249--264
             Ákos Seress   Square-Free Non-Cayley Numbers. On
                                  Vertex-Transitive Non-Cayley Graphs of
                                  Square-Free Order  . . . . . . . . . . . 265--281
             Joseph A. Thas and   
          Hendrik Van Maldeghem   Some Characterizations of Finite
                                  Hermitian Veroneseans  . . . . . . . . . 283--293
                R. D. Baker and   
                G. L. Ebert and   
                   Tim Penttila   Hyperbolic Fibrations and $q$-Clans  . . 295--305
               Paul Terwilliger   Two Linear Transformations each
                                  Tridiagonal with Respect to an
                                  Eigenbasis of the other; Comments on the
                                  Parameter Array  . . . . . . . . . . . . 307--332
                   Hans Cuypers   A Note on the Tight Spherical $7$-Design
                                  in and $5$-Design in . . . . . . . . . . 333--337
                   Klaus Metsch   Blocking Structures of Hermitian
                                  Varieties  . . . . . . . . . . . . . . . 339--360


Designs, Codes, and Cryptography
Volume 35, Number 1, April, 2005

          Jovan DJ. Goli\'c and   
                  Philip Hawkes   Vectorial Approach to Fast Correlation
                                  Attacks  . . . . . . . . . . . . . . . . 5--19
           John P. Mcsorley and   
          N. C. K. Phillips and   
               W. D. Wallis and   
                         others   Double Arrays, Triple Arrays and
                                  Balanced Grids . . . . . . . . . . . . . 21--45
             Wen-Guey Tzeng and   
                  Zhi-Jia Tzeng   A Public-Key Traitor Tracing Scheme with
                                  Revocation Using Dynamic Shares  . . . . 47--61
          Thierry P. Berger and   
                Pierre Loidreau   How to Mask the Structure of Codes for a
                                  Cryptographic Use  . . . . . . . . . . . 63--79
              Olgica Milenkovic   Support Weight Enumerators and Coset
                                  Weight Distributions of Isodual Codes    81--109
               Florian Hess and   
            Igor E. Shparlinski   On the Linear Complexity and
                                  Multidimensional Distribution of
                                  Congruential Generators over Elliptic
                                  Curves . . . . . . . . . . . . . . . . . 111--117
             Daniel R. L. Brown   Generic Groups, Collision Resistance,
                                  and ECDSA  . . . . . . . . . . . . . . . 119--152

Designs, Codes, and Cryptography
Volume 35, Number 2, May, 2005

            Rafa\l Bia\lota and   
                  Grzegorz Kawa   Modified Alternating
                                  $\stackrel{\rightarrow}{k}$ generators   159--174
                 Tatsuya Maruta   Extendability of Ternary Linear Codes    175--190
               Mingyuan Xia and   
               Tianbing Xia and   
               Jennifer Seberry   A New Method for Constructing Williamson
                                  Matrices . . . . . . . . . . . . . . . . 191--209
     Cícero Carvalho and   
                Fernando Torres   On Goppa Codes and Weierstrass Gaps at
                                  Several Points . . . . . . . . . . . . . 211--225
             Tran Van Trung and   
             Sosina Martirosyan   New Constructions for IPP Codes  . . . . 227--239
Patric R. J. Östergård and   
        Jörn Quistorff and   
              Alfred Wassermann   New Results on Codes with Covering
                                  Radius $1$ and Minimum Distance $2$  . . 241--250

Designs, Codes, and Cryptography
Volume 35, Number 3, June, 2005

               Petr Lisonek and   
           Mahadad Khatirinejad   A Family of Complete Caps in ${\rm
                                  PG}(n,2)$  . . . . . . . . . . . . . . . 259--270
    Harri Haanpää and   
                  Petteri Kaski   The Near Resolvable $2-(13, 4, 3)$
                                  Designs and Thirteen-Player Whist
                                  Tournaments  . . . . . . . . . . . . . . 271--285
                 Gennian GE and   
               C. W. H. LAM and   
            Alan C. H. Ling and   
                         others   Resolvable Maximum Packings with
                                  Quadruples . . . . . . . . . . . . . . . 287--302
              Yury J. Ionin and   
                Hadi Kharaghani   A Recursive Construction for New
                                  Symmetric Designs  . . . . . . . . . . . 303--310
             Stelvio Cimato and   
          Roberto De Prisco and   
              Alfredo De Santis   Optimal Colored Threshold Visual
                                  Cryptography Schemes . . . . . . . . . . 311--335
                  D. Luyckx and   
                     J. A. Thas   Trialities and $1$-Systems of $Q^+(7,q)$ 337--352


Designs, Codes, and Cryptography
Volume 36, Number 1, July, 2005

              S. G. Barwick and   
             Wen-Ai Jackson and   
                Keith M. Martin   A General Approach to Robust Web
                                  Metering . . . . . . . . . . . . . . . . 5--27
                 John C. Galati   On the Non-existence of Semiregular
                                  Relative Difference Sets in Groups with
                                  All Sylow Subgroups Cyclic . . . . . . . 29--31
               Mathieu Ciet and   
                      Marc Joye   Elliptic Curve Cryptosystems in the
                                  Presence of Permanent and Transient
                                  Faults . . . . . . . . . . . . . . . . . 33--43
               Carl Bracken and   
                   Gary Mcguire   Characterization of SDP Designs That
                                  Yield Certain Spin Models  . . . . . . . 45--52
             Iuon-Chang Lin and   
           Min-Shiang Hwang and   
                Chin-Chen Chang   The General Pay-Word: A Micro-payment
                                  Scheme Based on $n$-dimension One-way
                                  Hash Chain . . . . . . . . . . . . . . . 53--67
             J. Löfvenberg   Binary Fingerprinting Codes  . . . . . . 69--81
                      L. Ji and   
                      D. Wu and   
                         L. Zhu   Existence of Generalized Steiner Systems
                                  $\mathrm{GS}(2,4,\nu,2)$ . . . . . . . . 83--99
                 J. Eisfeld and   
                  L. Storme and   
                     P. Sziklai   On the Spectrum of the Sizes of Maximal
                                  Partial Line Spreads in
                                  $\mathrm{PG}(2n,q), n \geq 3$  . . . . . 101--110

Designs, Codes, and Cryptography
Volume 36, Number 2, August, 2005

                     J. De Kaey   On a More General Characterisation of
                                  Steiner Systems  . . . . . . . . . . . . 117--129
                P. Langevin and   
                  J.-P. Zanotti   Nonlinearity of Some Invariant Boolean
                                  Functions  . . . . . . . . . . . . . . . 131--146
                   F. L. Chiera   Type II Codes over , Invariant Rings and
                                  Theta Series . . . . . . . . . . . . . . 147--158
                  Shenglin Zhou   Block Primitive $2-(v,k,1)$ Designs
                                  Admitting a Ree Group of Characteristic
                                  Two  . . . . . . . . . . . . . . . . . . 159--169
               Ka Hin Leung and   
               Bernhard Schmidt   The Field Descent Method . . . . . . . . 171--188
                  Claude Carlet   Concatenating Indicators of Flats for
                                  Designing Cryptographic Functions  . . . 189--202
                     Vikram Jha   Local Schur's Lemma and Commutative
                                  Semifields . . . . . . . . . . . . . . . 203--216

Designs, Codes, and Cryptography
Volume 36, Number 3, September, 2005

            Manish K. Gupta and   
         Mahesh C. Bhandari and   
                  Arbind K. Lal   On Linear Codes over $\mathbb{Z}_2^s$    227--244
                 Ezra Brown and   
             Bruce T. Myers and   
              Jerome A. Solinas   Hyperelliptic Curves with Compact
                                  Parameters . . . . . . . . . . . . . . . 245--261
            Keith M. Martin and   
           Rei Safavi-Naini and   
              Huaxiong Wang and   
                  Peter R. Wild   Distributing the Encryption and
                                  Decryption of a Block Cipher . . . . . . 263--287
                E. J. Cheon and   
                    T. Kato and   
                      S. J. Kim   Nonexistence of $[n, 5, d]_q$ Codes
                                  Attaining the Griesmer Bound for $q^4 -
                                  2 q^2 - 2 q + 1 \leq d \leq q^4 - 2 q^2
                                  - q$ . . . . . . . . . . . . . . . . . . 289--299
 Juan Manuel Gonzalez Nieto and   
                 Colin Boyd and   
                      Ed Dawson   A Public Key Cryptosystem Based On A
                                  Subgroup Membership Problem  . . . . . . 301--316
                P. Véron   Proof of Conjectures on the True
                                  Dimension of Some Binary Goppa Codes . . 317--325
Patric R. J. Östergård   Two New Four-Error-Correcting Binary
                                  Codes  . . . . . . . . . . . . . . . . . 327--329
               Stephen D. Cohen   Finite Field Elements with Specified
                                  Order and Traces . . . . . . . . . . . . 331--340
                      Anonymous   Volume Table of Contents: Volume 36  . . 341--342


Designs, Codes, and Cryptography
Volume 37, Number 1, October, 2005

               Anka Golemac and   
            Tanja Vucici\'c and   
                 Josko Mandi\'c   One $(96,20,4)$-symmetric Design and
                                  related Nonabelian Difference Sets . . . 5--13
           A. J. van Zanten and   
               I Nengah Suparta   On the Construction of Linear $q$-ary
                                  Lexicodes  . . . . . . . . . . . . . . . 15--29
          Philippe Langevin and   
            Pascal Véron   On the Non-linearity of Power Functions  31--43
        Gerzson Kéri and   
Patric R. J. Östergård   Bounds for Covering Codes over Large
                                  Alphabets  . . . . . . . . . . . . . . . 45--60
       Alexander A. Davydov and   
              Giorgio Faina and   
             Fernanda Pambianco   Constructions of Small Complete Caps in
                                  Binary Projective Spaces . . . . . . . . 61--80
                John Malone-Lee   Signcryption with Non-interactive
                                  Non-repudiation  . . . . . . . . . . . . 81--109
              Masaaki Homma and   
                 Seon Jeong Kim   Toward the Determination of the Minimum
                                  Distance of Two--Point Codes on a
                                  Hermitian Curve  . . . . . . . . . . . . 111--132
         Friederike Brezing and   
                  Annegret Weng   Elliptic Curves Suitable for Pairing
                                  Based Cryptography . . . . . . . . . . . 133--141
               B. Tayfeh-Rezaie   On the Existence of Large Sets of
                                  $t$-designs of Prime Sizes . . . . . . . 143--149
                R. Ahlswede and   
                H. Aydinian and   
              L. H. Khachatrian   Forbidden (0,1)-vectors in Hyperplanes
                                  of $\mathbb{R}^n$: The unrestricted case 151--167

Designs, Codes, and Cryptography
Volume 37, Number 2, November, 2005

              Miin Huey Ang and   
                     Siu Lun Ma   Symmetric Weighing Matrices Constructed
                                  using Group Matrices . . . . . . . . . . 195--210
     Jürgen Bierbrauer and   
                      Yves Edel   A Family of Binary $(t, m, s)$-Nets of
                                  Strength $5$ . . . . . . . . . . . . . . 211--214
          G. B. Belyavskaya and   
               V. I. Izbash and   
                   G. L. Mullen   Check Character Systems using
                                  Quasigroups: I . . . . . . . . . . . . . 215--227
            R. Safavi-naini and   
                     C. Charnes   MRD Hashing  . . . . . . . . . . . . . . 229--242
               K. T. Phelps and   
                  J. Rif\`a and   
                  M. Villanueva   Kernels and $p$-Kernels of $p^r$-ary
                                  1-Perfect Codes  . . . . . . . . . . . . 243--261
                  Bart De Bruyn   Slim Near Polygons . . . . . . . . . . . 263--280
                   Jianxing Yin   Cyclic Difference Packing and Covering
                                  Arrays . . . . . . . . . . . . . . . . . 281--292
                Chihiro Suetake   The Classification of Symmetric
                                  Transversal Designs STD$_4[12;3]$'s  . . 293--304
         Antonino Giorgio Spera   Asymptotically Good Codes from
                                  Generalized Algebraic--Geometry Codes    305--312
               John P. Mcsorley   Double Arrays, Triple Arrays and
                                  Balanced Grids with $v = r + c - 1$  . . 313--318

Designs, Codes, and Cryptography
Volume 37, Number 3, December, 2005

              S. G. Barwick and   
                 Wen-AI Jackson   An Optimal Multisecret Threshold Scheme
                                  Construction . . . . . . . . . . . . . . 367--389
            A. YA. Dorofeev and   
              L. S. Kazarin and   
           V. M. Sidelnikov and   
                 M. E. Tuzhilin   Matrix Groups Related to the Quaternion
                                  Group and Spherical Orbit Codes  . . . . 391--404
          G. B. Belyavskaya and   
               V. I. Izbash and   
                   G. L. Mullen   Check Character Systems Using
                                  Quasigroups: II  . . . . . . . . . . . . 405--419
                E. J. Cheon and   
                    T. Kato and   
                      S. J. Kim   On the Minimum Length of some Linear
                                  Codes of Dimension $5$ . . . . . . . . . 421--434
              A. Wispelaere and   
                   H. Maldeghem   Codes from Generalized Hexagons  . . . . 435--448
              Claude Carlet and   
                Joseph L. Yucas   Piecewise Constructions of Bent and
                                  Almost Optimal Boolean Functions . . . . 449--464
          T. Aaron Gulliver and   
             Masaaki Harada and   
           Takuji Nishimura and   
Patric R. J. Östergård   Near-Extremal Formally Self-Dual Even
                                  Codes of Lengths $24$ and $32$ . . . . . 465--471
           Gretchen L. Matthews   Weierstrass Semigroups and Codes from a
                                  Quotient of the Hermitian Curve  . . . . 473--492
               Omran Ahmadi and   
                 Alfred Menezes   On the Number of Trace-One Elements in
                                  Polynomial Bases for $\mathbb{F}_2^n$    493--507
        Jens-Matthias Bohli and   
          Rainer Steinwandt and   
María Isabel González Vasco and   
       Consuelo Martínez   Weak Keys in MST$_1$ . . . . . . . . . . 509--524


Designs, Codes, and Cryptography
Volume 38, Number 1, January, 2006

                 Masaaki Harada   Self-Orthogonal $3-(56,12,65)$ Designs
                                  and Extremal Doubly-Even Self-Dual Codes
                                  of Length $56$ . . . . . . . . . . . . . 5--16
                Mehmet Ozen and   
                     Irfan Siap   Linear Codes over $\mathbb{F}_q[u] /
                                  (u^s)$ with Respect to the
                                  Rosenbloom--Tsfasman Metric  . . . . . . 17--29
                 T. L. Alderson   $(6,3)$-MDS Codes over an Alphabet of
                                  Size $4$ . . . . . . . . . . . . . . . . 31--40
Jean-Sébastien Coron and   
             David Naccache and   
                Yvo Desmedt and   
             Andrew Odlyzko and   
                Julien P. Stern   Index Calculation Attacks on RSA
                                  Signature and Encryption . . . . . . . . 41--53
              Masaaki Homma and   
                 Seon Jeong Kim   The Two-Point Codes on a Hermitian Curve
                                  with the Designed Minimum Distance . . . 55--81
                          L. Ji   Asymptotic Determination of the Last
                                  Packing Number of Quadruples . . . . . . 83--95
        Steven T. Dougherty and   
         T. Aaron. Gulliver and   
                    Manabu Oura   Higher Weights for Ternary and
                                  Quaternary Self-Dual Codes . . . . . . . 97--112
                 Michel Lavrauw   Sublines of Prime Order Contained in the
                                  Set of Internal Points of a Conic  . . . 113--123
                     Olof Heden   A Full Rank Perfect Code of Length $31$  125--129
                Simeon Ball and   
           Patrick Govaerts and   
                     Leo Storme   On Ovoids of Parabolic Quadrics  . . . . 131--145

Designs, Codes, and Cryptography
Volume 38, Number 2, February, 2006

             Wilfried Meidl and   
                 Arne Winterhof   Some Notes on the Linear Complexity of
                                  Sidel'nikov--Lempel--Cohn--Eastman
                                  Sequences  . . . . . . . . . . . . . . . 159--178
            Frank de Clerck and   
          Stefaan de Winter and   
          Elisabeth Kuijken and   
                Cristina Tonesi   Distance-Regular $(0, \alpha)$-Reguli    179--194
                   Sara Cauchie   A Characterization of the Complement of
                                  a Hyperbolic Quadric in ${\rm PG}(3,q)$,
                                  for $q$ Odd  . . . . . . . . . . . . . . 195--208
              Michael Scott and   
         Paulo S. L. M. Barreto   Generating More MNT Elliptic Curves  . . 209--217
               Gwoboa Horng and   
              Tzungher Chen and   
                  Du-shiau Tsai   Cheating in Visual Cryptography  . . . . 219--236
                  Ari Juels and   
                    Madhu Sudan   A Fuzzy Vault Scheme . . . . . . . . . . 237--257
                  D. R. Stinson   Some Observations on the Theory of
                                  Cryptographic Hash Functions . . . . . . 259--277
            Khoongming Khoo and   
                 Guang Gong and   
             Douglas R. Stinson   A New Characterization of Semi-bent and
                                  Bent Functions on Finite Fields* . . . . 279--295
                  Eric Merchant   Exponentially Many Hadamard Designs  . . 297--308

Designs, Codes, and Cryptography
Volume 38, Number 3, March, 2006

            Norifumi Kamiya and   
           Marc P. C. Fossorier   Quasi-Cyclic Codes from a Finite Affine
                                  Plane  . . . . . . . . . . . . . . . . . 311--329
                Petri Rosendahl   A Generalization of Niho's Theorem . . . 331--336
                   San Ling and   
        Harald Niederreiter and   
            Patrick Solé   On the Algebraic Structure of
                                  Quasi-cyclic Codes IV: Repeated Roots    337--361
                 Vince Grolmusz   Co-Orthogonal Codes  . . . . . . . . . . 363--372
                    Jinhua Wang   A New Class of Optimal $3$-splitting
                                  Authentication Codes . . . . . . . . . . 373--381
                  Annegret Weng   A Low-Memory Algorithm for Point
                                  Counting on Picard Curves  . . . . . . . 383--393
                   Omran Ahmadi   Self-Reciprocal Irreducible Pentanomials
                                  Over $\mathbb{F}_2$  . . . . . . . . . . 395--397
                 Benjamin Arazi   Communication-Computation Trade-off in
                                  Executing ECDSA in a Contactless
                                  Smartcard  . . . . . . . . . . . . . . . 399--415


Designs, Codes, and Cryptography
Volume 39, Number 1, April, 2006

                   Jeremy Dover   Subregular Spreads of Hermitian Unitals  5--15
        Mahdad Khatirinejad and   
                   Petr Lisonek   Classification and Constructions of
                                  Complete Caps in Binary Spaces . . . . . 17--31
              A. Cossidente and   
                   A. Siciliano   The Automorphism Group of Plane
                                  Algebraic Curves with Singer
                                  Automorphisms  . . . . . . . . . . . . . 33--37
                   Tao Feng and   
                   Yanxun Chang   Existence of Z-cyclic ${\rm 3PTWh}(p)$
                                  for any Prime $p \equiv 1$ (mod $4$) . . 39--49
          Agnes D. Garciano and   
            Yutaka Hiramine and   
                 Takeo Yokonuma   On Relative Difference Sets in Dihedral
                                  Groups . . . . . . . . . . . . . . . . . 51--63
        Steven T. Dougherty and   
                  Young Ho Park   Codes Over the $p$-adic Integers . . . . 65--80
               S. De Winter and   
                        K. Thas   Generalized Quadrangles with an Abelian
                                  Singer Group . . . . . . . . . . . . . . 81--87
                Barbara Masucci   Sharing Multiple Secrets: Models,
                                  Schemes and Analysis . . . . . . . . . . 89--111
            Igor E. Shparlinski   On RSA Moduli with Prescribed Bit
                                  Patterns . . . . . . . . . . . . . . . . 113--122

Designs, Codes, and Cryptography
Volume 39, Number 2, May, 2006

        Steven T. Dougherty and   
                       San Ling   Cyclic Codes Over $\mathbb{Z}_4$ of Even
                                  Length . . . . . . . . . . . . . . . . . 127--153
                 Hassan Aly and   
                 Arne Winterhof   On the Linear Complexity Profile of
                                  Nonlinear Congruential Pseudorandom
                                  Number Generators with Dickson
                                  Polynomials  . . . . . . . . . . . . . . 155--162
                Michael Giudici   Codes with a Certain Weight-preserving
                                  Transitive Group of Automorphisms  . . . 163--172
                 Kejun Chen and   
                   Ruizhong Wei   Super-simple $(\nu, 5, 5)$ Designs . . . 173--187
               Mathieu Ciet and   
                  Marc Joye and   
             Kristin Lauter and   
            Peter L. Montgomery   Trading Inversions for Multiplications
                                  in Elliptic Curve Cryptography . . . . . 189--206
                  Gilberto Bini   A-Codes from Rational Functions over
                                  Galois Rings . . . . . . . . . . . . . . 207--214
            Cem Güneri and   
            Ferruh Özbudak   Improvements on Generalized Hamming
                                  Weights of Some Trace Codes  . . . . . . 215--231
                   Gilles Piret   Luby--Rackoff Revisited: On the Use of
                                  Permutations as Inner Functions of a
                                  Feistel Scheme . . . . . . . . . . . . . 233--245
                Dean Crnkovi\'c   A Series of Regular Hadamard Matrices    247--251
            Marten Van Dijk and   
              Dwaine Clarke and   
             Blaise Gassend and   
              G. Edward Suh and   
               Srinivas Devadas   Speeding up Exponentiation using an
                                  Untrusted Computational Resource . . . . 253--273

Designs, Codes, and Cryptography
Volume 39, Number 3, June, 2006

                M. R. Darafsheh   Designs from the Group ${\rm PSL}_2(q)$,
                                  $q$ Even . . . . . . . . . . . . . . . . 311--316
    Sergey V. Avgustinovich and   
                 Olof Heden and   
             Faina I. Solov'eva   On Intersection Problem for Perfect
                                  Binary Codes . . . . . . . . . . . . . . 317--322
               Jan De Beule and   
                     Leo Storme   Blocking All Generators of $Q^+(2 n +
                                  1,3)$, $n \geq 4$  . . . . . . . . . . . 323--333
                 Jen-Chun Chang   New Algorithms of Distance-Increasing
                                  Mappings from Binary Vectors to
                                  Permutations by Swaps  . . . . . . . . . 335--345
                  Samuel Maffre   A Weak Key Test for Braid Based
                                  Cryptography . . . . . . . . . . . . . . 347--373
              Masaaki Homma and   
                 Seon Jeong Kim   The Two-Point Codes with the Designed
                                  Distance on a Hermitian Curve in Even
                                  Characteristic . . . . . . . . . . . . . 375--386
           Katie M. O'Brien and   
            Patrick Fitzpatrick   Bounds on Codes Derived by Counting
                                  Components in Varshamov Graphs . . . . . 387--396
             Angela Aguglia and   
              Massimo Giulietti   Blocking Sets of Certain Line Sets
                                  Related to a Conic . . . . . . . . . . . 397--405


Designs, Codes, and Cryptography
Volume 40, Number 1, July, 2006

              Masaaki Homma and   
                 Seon Jeong Kim   The Complete Determination of the
                                  Minimum Distance of Two-Point Codes on a
                                  Hermitian Curve  . . . . . . . . . . . . 5--24
           Peter J. Grabner and   
              Clemens Heuberger   On the Number of Optimal Base $2$
                                  Representations of Integers  . . . . . . 25--39
         Deepak Kumar Dalai and   
            Subhamoy Maitra and   
                 Sumanta Sarkar   Basic Theory in Construction of Boolean
                                  Functions with Maximum Possible
                                  Annihilator Immunity . . . . . . . . . . 41--58
         François Rodier   Asymptotic Nonlinearity of Boolean
                                  Functions  . . . . . . . . . . . . . . . 59--70
              Claude Carlet and   
              Cunsheng Ding and   
            Harald Niederreiter   Authentication Schemes from Highly
                                  Nonlinear Functions  . . . . . . . . . . 71--79
                Hiroki Koga and   
                    Etsuyo Ueda   Basic Properties of the
                                  $(t,n)$-Threshold Visual Secret Sharing
                                  Scheme with Perfect Reconstruction of
                                  Black Pixels . . . . . . . . . . . . . . 81--102
             Javier Herranz and   
      Germán Sáez   Distributed Ring Signatures from General
                                  Dual Access Structures . . . . . . . . . 103--120
               Anthony B. Evans   Latin Squares without Orthogonal Mates   121--130
             Ian M. Wanless and   
                Bridget S. Webb   The Existence of Latin Squares without
                                  Orthogonal Mates . . . . . . . . . . . . 131--135

Designs, Codes, and Cryptography
Volume 40, Number 2, August, 2006

             Yen-Ying Huang and   
              Shi-Chun Tsai and   
                   Hsin-Lung Wu   On the Construction of Permutation
                                  Arrays via Mappings from Binary Vectors
                                  to Permutations  . . . . . . . . . . . . 139--155
              Cunsheng Ding and   
                   Jianxing Yin   A Construction of Optimal Constant
                                  Composition Codes  . . . . . . . . . . . 157--165
               Yanxun Chang and   
                  Cunsheng Ding   Constructions of External Difference
                                  Families and Disjoint Difference
                                  Families . . . . . . . . . . . . . . . . 167--185
      Octavio Páez Osuna   There are $1239$ Steiner Triple Systems
                                  ${\rm STS}(31)$ of $2$-rank $27$ . . . . 187--190
               Shoulun Long and   
             Josef Pieprzyk and   
              Huaxiong Wang and   
                 Duncan S. Wong   Generalised Cumulative Arrays in Secret
                                  Sharing  . . . . . . . . . . . . . . . . 191--209
              R. J. R. Abel and   
                  F. E. Bennett   The Existence of $(\nu, 6,
                                  \lambda)$-Perfect Mendelsohn Designs
                                  with $\lambda > 1$  . . . . . . . . . . . 211--224
           Mike J. Grannell and   
            Terry S. Griggs and   
            Anne Penfold Street   A Flaw in the Use of Minimal Defining
                                  Sets for Secret Sharing Schemes  . . . . 225--236
             Andreas Faldum and   
             Julio Lafuente and   
              Gustavo Ochoa and   
               Wolfgang Willems   Error Probabilities for Bounded Distance
                                  Decoding . . . . . . . . . . . . . . . . 237--252

Designs, Codes, and Cryptography
Volume 40, Number 3, September, 2006

               Mausumi Bose and   
                 Rahul Mukerjee   Optimal $(2,n)$ visual cryptographic
                                  schemes  . . . . . . . . . . . . . . . . 255--267
           Brendan D. McKay and   
         Jeanette C. McLeod and   
                 Ian M. Wanless   The number of transversals in a Latin
                                  square . . . . . . . . . . . . . . . . . 269--284
           Christopher Wolf and   
                 An Braeken and   
                   Bart Preneel   On the security of stepwise triangular
                                  systems  . . . . . . . . . . . . . . . . 285--302
                 Gennian Ge and   
                  Ying Miao and   
                         L. Zhu   GOB designs for authentication codes
                                  with arbitration . . . . . . . . . . . . 303--317
                 Olof Heden and   
                 Martin Hessler   On the classification of perfect codes:
                                  side class structures  . . . . . . . . . 319--333
             David G. Glynn and   
           Johannes G. Maks and   
                      Rey Casse   The polynomial degree of the
                                  Grassmannian $G(1,n,q)$ of lines in
                                  finite projective space ${\rm PG}(n,q)$  335--341
              Sean V. Droms and   
         Keith E. Mellinger and   
                    Chris Meyer   LDPC codes generated by conics in the
                                  classical projective plane . . . . . . . 343--356
                Peter Horak and   
              Bader F. AlBdaiwi   Fast decoding of quasi-perfect Lee
                                  distance codes . . . . . . . . . . . . . 357--367
                 Hassan Aly and   
                 Arne Winterhof   On the $k$-error linear complexity over
                                  $\mathbb{F}_p$ of Legendre and
                                  Sidelnikov sequences . . . . . . . . . . 369--374


Designs, Codes, and Cryptography
Volume 41, Number 1, October, 2006

           Rei Safavi-Naini and   
                  Huaxiong Wang   Secret sharing schemes with partial
                                  broadcast channels . . . . . . . . . . . 5--22
                  Julien Moncel   Constructing codes identifying sets of
                                  vertices . . . . . . . . . . . . . . . . 23--31
        Charles J. Colbourn and   
      Sosina S. Martirosyan and   
             Tran Van Trung and   
               Robert A. Walker   Roux-type constructions for covering
                                  arrays of strengths three and four . . . 33--57
           Iliya Bouyukliev and   
                Veerle Fack and   
           Wolfgang Willems and   
                    Joost Winne   Projective two-weight codes with small
                                  parameters and their corresponding
                                  graphs . . . . . . . . . . . . . . . . . 59--78
              Peter Keevash and   
                  Cheng Yeaw Ku   A random construction for permutation
                                  codes and the covering radius  . . . . . 79--86
                 Vince Grolmusz   Pairs of codes with prescribed Hamming
                                  distances and coincidences . . . . . . . 87--99
         Stefka Bouyuklieva and   
Patric R. J. Östergård   New constructions of optimal self-dual
                                  binary codes of length $54$  . . . . . . 101--109
                K. T. Arasu and   
               Ka Hin Leung and   
                 Siu Lun Ma and   
                 Ali Nabavi and   
            D. K. Ray-Chaudhuri   Circulant weighing matrices of weight
                                  $2^{2 t}$  . . . . . . . . . . . . . . . 111--123

Designs, Codes, and Cryptography
Volume 41, Number 2, November, 2006

                 Vikram Jha and   
              Norman L. Johnson   Subregular planes admitting elations . . 125--145
                  Marcelo Muniz   Isometric embeddings of $\mathbb{Z}_p^k$
                                  in the Hamming space $\mathbb{F}_p^N$
                                  and $\mathbb{Z}_p^k$-linear codes  . . . 147--152
               Robert F. Bailey   Uncoverings-by-bases for base-transitive
                                  permutation groups . . . . . . . . . . . 153--176
                 Zhenfu Cao and   
                 Gennian Ge and   
                      Ying Miao   Combinatorial characterizations of
                                  one-coincidence frequency-hopping
                                  sequences  . . . . . . . . . . . . . . . 177--184
            Stefko Miklavic and   
                Primoz Potocnik   Distance-transitive dihedrants . . . . . 185--193
               Carl Bracken and   
               Gary McGuire and   
                    Harold Ward   New quasi-symmetric designs constructed
                                  using mutually orthogonal Latin squares
                                  and Hadamard matrices  . . . . . . . . . 195--198
                 C. Galindo and   
                     M. Sanchis   Evaluation codes and plane valuations    199--219
                  Lihua Liu and   
                       Hao Shen   Explicit constructions of separating
                                  hash families from algebraic curves over
                                  finite fields  . . . . . . . . . . . . . 221--233

Designs, Codes, and Cryptography
Volume 41, Number 3, December, 2006

        Steven T. Dougherty and   
          T. Aaron Gulliver and   
                      John Wong   Self-dual codes over $\mathbb{Z}_8$ and
                                  $\mathbb{Z}_9$ . . . . . . . . . . . . . 235--249
          Takehiro Hasegawa and   
              Shoichi Kondo and   
                Hidekazu Kurusu   A sequence of one-point codes from a
                                  tower of function fields . . . . . . . . 251--267
                   Jun Shen and   
                       Hao Shen   Embeddings of resolvable group divisible
                                  designs with block size $3$  . . . . . . 269--298
               Soonhak Kwon and   
             Chang Hoon Kim and   
                  Chun Pyo Hong   Sparse polynomials, redundant bases,
                                  Gauss periods, and efficient
                                  exponentiation of primitive elements for
                                  small characteristic finite fields . . . 299--306
                   Ali Miri and   
              Monica Nevins and   
            Terasan Niyomsataya   Applications of representation theory to
                                  wireless communications  . . . . . . . . 307--318
                   Carl Bracken   New classes of self-complementary codes
                                  and quasi-symmetric designs  . . . . . . 319--323
         Pascal O. Vontobel and   
                 Ashwin Ganesan   On universally decodable matrices for
                                  space-time coding  . . . . . . . . . . . 325--342
        Ferruh Özbudak and   
       Zülfükar Saygi   Some constructions of systematic
                                  authentication codes using Galois rings  343--357


Designs, Codes, and Cryptography
Volume 42, Number 1, January, 2007

              Andrea Blunck and   
              Hans Havlicek and   
                Corrado Zanella   Lifting of divisible designs . . . . . . 1--14
              Chong-Dao Lee and   
               Yaotsu Chang and   
              Trieu-Kien Truong   A result on the weight distributions of
                                  binary quadratic residue codes . . . . . 15--20
                   Peter Roelse   The design of composite permutations
                                  with applications to DES-like S-boxes    21--42
               Nevine Ebeid and   
                 M. Anwar Hasan   On binary signed digit representations
                                  of integers  . . . . . . . . . . . . . . 43--65
               Simon Litsyn and   
               Beniamin Mounits   Improved lower bounds on sizes of
                                  single-error correcting codes  . . . . . 67--72
               Jon-Lark Kim and   
         Keith E. Mellinger and   
                     Leo Storme   Small weight codewords in LDPC codes
                                  defined by (dual) classical generalized
                                  quadrangles  . . . . . . . . . . . . . . 73--92
              Naoki Chigira and   
             Masaaki Harada and   
               Masaaki Kitazume   Extremal self-dual codes of length $64$
                                  through neighbors and covering radii . . 93--101
         Antonio Cossidente and   
                Giuseppe Marino   Veronese embedding and two-character
                                  sets . . . . . . . . . . . . . . . . . . 103--107

Designs, Codes, and Cryptography
Volume 42, Number 2, February, 2007

               Bessie C. Hu and   
             Duncan S. Wong and   
             Zhenfeng Zhang and   
                   Xiaotie Deng   Certificateless signature: a new
                                  security model and an improved generic
                                  construction . . . . . . . . . . . . . . 109--126
         Jürgen Bierbrauer   A direct approach to linear programming
                                  bounds for codes and tms-nets  . . . . . 127--143
          Sanjeevani Gharge and   
                    Sharad Sane   Quasi-affine symmetric designs . . . . . 145--166
            Amir J. Salomon and   
                    Ofer Amrani   Reed--Muller codes and Barnes--Wall
                                  lattices: Generalized multilevel
                                  constructions and representation over
                                  ${\rm GF}(2^q)$  . . . . . . . . . . . . 167--180
             Wilfried Meidl and   
         Ayineedi Venkateswarlu   Remarks on the $k$-error linear
                                  complexity of $p^n$-periodic sequences   181--193
                 Maura Paterson   Sliding-window dynamic frameproof codes  195--212
         S. González and   
         C. Martínez and   
               I. F. Rúa   Symplectic spread-based generalized
                                  Kerdock codes  . . . . . . . . . . . . . 213--226
              Dongvu Tonien and   
          Reihaneh Safavi-Naini   Construction of deletion correcting
                                  codes using generalized Reed--Solomon
                                  codes and their subcodes . . . . . . . . 227--237

Designs, Codes, and Cryptography
Volume 42, Number 3, March, 2007

     Paulo S. L. M. Barreto and   
        Steven D. Galbraith and   
Colm Ó'hÉigeartaigh and   
                  Michael Scott   Efficient pairing computation on
                                  supersingular Abelian varieties  . . . . 239--271
             Taher Abualrub and   
                     Irfan Siap   Cyclic codes over the rings $Z_2 + u
                                  Z_2$ and $Z_2 + u Z_2 + u^2 Z_2$ . . . . 273--287
               Eimear Byrne and   
           Marcus Greferath and   
          Michael E. O'Sullivan   The linear programming bound for codes
                                  over finite Frobenius rings  . . . . . . 289--301
                 Valentina Pepe   LDPC codes from the Hermitian curve  . . 303--315
                 Maura Paterson   Sequential and dynamic frameproof codes  317--326
               Gerardo Vega and   
               Jacques Wolfmann   New classes of $2$-weight cyclic codes   327--334
         Thomas Westerbäck   Maximal partial packings of $Z_2^n$ with
                                  perfect codes  . . . . . . . . . . . . . 335--355


Designs, Codes, and Cryptography
Volume 43, Number 1, April, 2007

                    Shane Kelly   Constructions of intriguing sets of
                                  polar spaces from field reduction and
                                  derivation . . . . . . . . . . . . . . . 1--8
                Fang-Wei Fu and   
                    Shu-Tao Xia   The characterization of binary constant
                                  weight codes meeting the bound of Fu and
                                  Shen . . . . . . . . . . . . . . . . . . 9--20
               Nikias De Feyter   Classification of $(0,2)$-geometries
                                  embedded in ${\rm AG}(3,q)$  . . . . . . 21--32
             Andrea Caggegi and   
               Giovanni Falcone   On $2-(n^2, 2 n, 2n-1)$ designs with
                                  three intersection numbers . . . . . . . 33--40
               Sabine Giese and   
             Ralph-Hardo Schulz   Divisible designs with dual translation
                                  group  . . . . . . . . . . . . . . . . . 41--45
                Tetsuya Izu and   
                 Jun Kogure and   
            Takeshi Koshiba and   
              Takeshi Shimoyama   Low-density attack revisited . . . . . . 47--59

Designs, Codes, and Cryptography
Volume 43, Number 2--3, June, 2007

            Aggelos Kiayias and   
                      Moti Yung   Cryptanalyzing the
                                  polynomial-reconstruction based
                                  public-key system under optimal
                                  parameter choice . . . . . . . . . . . . 61--78
            Jonathan Jedwab and   
              Matthew G. Parker   There are no Barker arrays having more
                                  than two dimensions  . . . . . . . . . . 79--84
                 I. Gashkov and   
            J. A. O. Ekberg and   
                        D. Taub   A geometric approach to finding new
                                  lower bounds of $A(n, d, w)$ . . . . . . 85--91
              Ji-Woong Jang and   
               Jong-Seon No and   
                   Habong Chung   Butson Hadamard matrices with partially
                                  cyclic core  . . . . . . . . . . . . . . 93--101
                     John Arhin   On the structure of $1$-designs with at
                                  most two block intersection numbers  . . 103--114
                       Lijun Ji   A construction for large sets of
                                  disjoint Kirkman triple systems  . . . . 115--122
                E. J. Cheon and   
                      T. Maruta   On the minimum length of some linear
                                  codes  . . . . . . . . . . . . . . . . . 123--135
       Maria Bras-Amorós   Algebraic-geometry codes, one-point
                                  codes, and evaluation codes  . . . . . . 137--145
                Bahattin Yildiz   Weights modulo $p^e$ of linear codes
                                  over rings . . . . . . . . . . . . . . . 147--165
             Wen-Ai Jackson and   
                      S. Murphy   Projective aspects of the AES inversion  167--179


Designs, Codes, and Cryptography
Volume 44, Number 1--3, September, 2007

              Dina Ghinelli and   
           James Hirschfeld and   
              Dieter Jungnickel   Preface  . . . . . . . . . . . . . . . . 1--2
                     J. A. Thas   The uniqueness of $1$-systems of
                                  $W_5(q)$ satisfying the BLT-property,
                                  with $q$ odd . . . . . . . . . . . . . . 3--10
              P. J. Cameron and   
                    A. Rudvalis   A design and a geometry for the group
                                  ${\rm Fi}_{22}$  . . . . . . . . . . . . 11--14
              Gary L. Ebert and   
             Keith E. Mellinger   Mixed partitions and related designs . . 15--23
                 Alan R. Prince   A translation plane of order $19^2$
                                  admitting ${\rm SL}(2,5)$, obtained by
                                  $12$-nest replacement  . . . . . . . . . 25--30
                 Antonio Pasini   A characterization of truncated
                                  projective geometries as flag-transitive
                                  ${\rm PG}^*.{\rm PG}$-geometries . . . . 31--38
             Guglielmo Lunardon   Simplectic spreads and finite semifields 39--48
               Guobiao Weng and   
               Weisheng Qiu and   
                Zeying Wang and   
                     Qing Xiang   Pseudo-Paley graphs and skew Hadamard
                                  difference sets from presemifields . . . 49--62
                Simeon Ball and   
                 Michel Lavrauw   On the Hughes--Kleinfeld and Knuth's
                                  semifields two-dimensional over a weak
                                  nucleus  . . . . . . . . . . . . . . . . 63--67
                M. Biliotti and   
                     V. Jha and   
              N. L. Johnson and   
                   A. Montinaro   Translation planes of order $q^2$
                                  admitting a two-transitive orbit of
                                  length $q + 1$ on the line at infinity   69--86


Designs, Codes, and Cryptography
Volume 45, Number 1, October, 2007

              Michael Dewar and   
                Lucia Moura and   
             Daniel Panario and   
              Brett Stevens and   
                     Qiang Wang   Division of trinomials by pentanomials
                                  and orthogonal arrays  . . . . . . . . . 1--17
Francisco Rodríguez-Henríquez and   
     Guillermo Morales-Luna and   
             Nazar A. Saqib and   
      Nareli Cruz-Cortés   Parallel Itoh--Tsujii multiplicative
                                  inversion algorithm for a special class
                                  of trinomials  . . . . . . . . . . . . . 19--37
                       Lijun Ji   Constructions for large sets of
                                  $L$-intersecting Steiner triple systems  39--49
           Morteza Esmaeili and   
                 Morteza Hivadi   $G$-projectable and
                                  $\Lambda$-projectable binary linear
                                  block codes  . . . . . . . . . . . . . . 51--64
                   Yu Xiong and   
                     Jun Ma and   
                       Hao Shen   On optimal codes with $w$-identifiable
                                  parent property  . . . . . . . . . . . . 65--90
            Esa Antero Seuranen   New lower bounds for multiple coverings  91--94
           Susan G. Barwick and   
                 Wen-Ai Jackson   A sequence approach to linear perfect
                                  hash families  . . . . . . . . . . . . . 95--121
                 I. Landjev and   
                      L. Storme   A weighted version of a result of Hamada
                                  on minihypers and on linear codes
                                  meeting the Griesmer bound . . . . . . . 123--138
               Xiande Zhang and   
                     Gennian Ge   Existence of $Z$-cyclic ${\rm
                                  3PDTWh}(p)$ for Prime $p \equiv 1$ (mod
                                  $4$) . . . . . . . . . . . . . . . . . . 139--155

Designs, Codes, and Cryptography
Volume 45, Number 2, November, 2007

                 Gennian Ge and   
                  Rolf Rees and   
                  Nabil Shalaby   Kirkman frames having hole type $h^u
                                  m^1$ for small $h$ . . . . . . . . . . . 157--184
                 Haitao Cao and   
                   Lijun Ji and   
                        Lie Zhu   Constructions for generalized Steiner
                                  systems ${\rm GS}(3, 4, v, 2)$ . . . . . 185--197
            Jaime Gutierrez and   
             Álvar Ibeas   Inferring sequences produced by a linear
                                  congruential generator on elliptic
                                  curves missing high-order bits . . . . . 199--212
             Tsvetan Asamov and   
                      Nuh Aydin   A search algorithm for linear codes:
                                  progressive dimension growth . . . . . . 213--217
    E. Martínez-Moro and   
               I. F. Rúa   On repeated-root multivariable codes
                                  over a finite chain ring . . . . . . . . 219--227
                       Ron Shaw   The $\psi$-associate $X^\#$ of a flat
                                  $X$ in ${\rm PG}(n, 2)$  . . . . . . . . 229--246
               Jon-Lark Kim and   
                    Yoonjin Lee   Construction of MDS self-dual codes over
                                  Galois rings . . . . . . . . . . . . . . 247--258
           Csaba Mengyán   On the number of pairwise non-isomorphic
                                  minimal blocking sets in ${\rm PG}(2,
                                  q)$  . . . . . . . . . . . . . . . . . . 259--267
               Eimear Byrne and   
           Marcus Greferath and   
          Michael E. O'Sullivan   Errata for ``The linear programming
                                  bound for codes over finite Frobenius
                                  rings''  . . . . . . . . . . . . . . . . 269--270

Designs, Codes, and Cryptography
Volume 45, Number 3, December, 2007

       Nevine Maurice Ebeid and   
                 M. Anwar Hasan   On $\tau$-adic representations of
                                  integers . . . . . . . . . . . . . . . . 271--296
                   San Ling and   
            Ferruh Özbudak   Constructions and bounds on linear
                                  error-block codes  . . . . . . . . . . . 297--316
               Ki Hyoung Ko and   
               Jang Won Lee and   
                    Tony Thomas   Towards generating secure keys for braid
                                  cryptography . . . . . . . . . . . . . . 317--333
              Radka Russeva and   
                 Nikolay Yankov   On binary self-dual codes of lengths
                                  $60$, $62$, $64$ and $66$ having an
                                  automorphism of order $9$  . . . . . . . 335--346
                  D. R. Stinson   Generalized mix functions and orthogonal
                                  equitable rectangles . . . . . . . . . . 347--357
     Cícero Carvalho and   
                     Takao Kato   Codes from curves with total inflection
                                  points . . . . . . . . . . . . . . . . . 359--364
          Gert Monstad Hana and   
                 Trygve Johnsen   Scroll codes . . . . . . . . . . . . . . 365--377
                  Koji Momihara   Necessary and sufficient conditions for
                                  tight equi-difference conflict-avoiding
                                  codes of weight three  . . . . . . . . . 379--390
                    Jinhua Wang   A new class of optimal $3$-splitting
                                  authentication codes . . . . . . . . . . 391--391


Designs, Codes, and Cryptography
Volume 46, Number 1, January, 2008

                Jinhua Wang and   
                       Hao Shen   Existence of $(v,K_{1(3)} \cup
                                  \{w^*\})$-PBDs and its applications  . . 1--16
             Vitaly Skachek and   
                    Ron M. Roth   Probabilistic algorithm for finding
                                  roots of linearized polynomials  . . . . 17--23
                Veerle Fack and   
       Szabolcs L. Fancsali and   
                  L. Storme and   
      Geetrui Van de Voorde and   
                    Joost Winne   Small weight codewords in the codes
                                  arising from Desarguesian projective
                                  planes . . . . . . . . . . . . . . . . . 25--43
                     Olof Heden   On perfect $p$-ary codes of length $p +
                                  1$ . . . . . . . . . . . . . . . . . . . 45--56
                 Wilfried Meidl   Reducing the calculation of the linear
                                  complexity of $u 2^v$-periodic binary
                                  sequences to Games--Chan algorithm . . . 57--65
              Weiming Zhang and   
                       Shiqu Li   A coding problem in steganography  . . . 67--81
             James A. Davis and   
                Laurent Poinsot   $G$-Perfect nonlinear functions  . . . . 83--96
         Sosina Martirosyan and   
                 Tran van Trung   Explicit constructions for perfect hash
                                  families . . . . . . . . . . . . . . . . 97--112
              Cunsheng Ding and   
                       Tao Feng   Codebooks from almost difference sets    113--126

Designs, Codes, and Cryptography
Volume 46, Number 2, February, 2008

              Norman L. Johnson   $m$th-Root subgeometry partitions  . . . 127--136
             Boris Skori\'c and   
       Stefan Katzenbeisser and   
                Mehmet U. Celik   Symmetric Tardos fingerprinting codes
                                  for arbitrary alphabet sizes . . . . . . 137--166
            Vito Abatangelo and   
                 Bambina Larato   Elliptic near-MDS codes over
                                  $\mathbb{F}_5$ . . . . . . . . . . . . . 167--174
               Thomas Britz and   
              Keisuke Shiromoto   Designs from subcode supports of linear
                                  codes  . . . . . . . . . . . . . . . . . 175--189
            Gerzson Kéri   The covering radius of extreme binary
                                  $2$-surjective codes . . . . . . . . . . 191--198
           Alessandro Montinaro   On the Ree Unital  . . . . . . . . . . . 199--209
               Jianxing Yin and   
                    Jie Yan and   
                  Chengmin Wang   Generalized balanced tournament designs
                                  and related codes  . . . . . . . . . . . 211--230
         Antonio Cossidente and   
             Nicola Durante and   
            Giuseppe Marino and   
               Tim Penttila and   
           Alessandro Siciliano   The geometry of some two-character sets  231--241

Designs, Codes, and Cryptography
Volume 46, Number 3, March, 2008

                 Aaron Potechin   Maximal caps in ${\rm AG}(6, 3)$ . . . . 243--259
             Giorgio Donati and   
                 Nicola Durante   On the intersection of two subgeometries
                                  of ${\rm PG}(n, q)$  . . . . . . . . . . 261--267
     Jürgen Bierbrauer and   
            Gohar M. Kyureghyan   Crooked binomials  . . . . . . . . . . . 269--301
    Maria Cristeta Cuaresma and   
            Michael Giudici and   
              Cheryl E. Praeger   Homogeneous factorisations of Johnson
                                  graphs . . . . . . . . . . . . . . . . . 303--327
               Berkant Ustaoglu   Obtaining a secure and efficient key
                                  agreement protocol from (H)MQV and NAXOS 329--342
             W. H. Holzmann and   
              H. Kharaghani and   
               B. Tayfeh-Rezaie   Williamson matrices up to order $59$ . . 343--352
          Nicholas Kolokotronis   Cryptographic properties of nonlinear
                                  pseudorandom number generators . . . . . 353--363
                   John Polhill   New negative Latin square type partial
                                  difference sets in nonelementary abelian
                                  $2$-groups and $3$-groups  . . . . . . . 365--377


Designs, Codes, and Cryptography
Volume 47, Number 1--3, June, 2008

                A. Blokhuis and   
        J. W. P. Hirschfeld and   
              D. Jungnickel and   
                     J. A. Thas   Finite geometries  . . . . . . . . . . . 1--2
                   S. De Winter   Non-isomorphic semipartial geometries    3--9
              Andrea Blunck and   
              Hans Havlicek and   
                Corrado Zanella   Divisible designs from twisted dual
                                  numbers  . . . . . . . . . . . . . . . . 11--20
                J. De Beule and   
                   A. Klein and   
                  K. Metsch and   
                      L. Storme   Partial ovoids and partial spreads in
                                  Hermitian polar spaces . . . . . . . . . 21--34
          B. N. Cooperstein and   
                    B. De Bruyn   The combinatorial properties of the
                                  hyperplanes of ${\rm DW}(5, q)$ arising
                                  from embedding . . . . . . . . . . . . . 35--51
           A. De Wispelaere and   
               H. Van Maldeghem   Regular partitions of (weak) finite
                                  generalized polygons . . . . . . . . . . 53--73
                  Kris Coolsaet   A $51$-dimensional embedding of the
                                  Ree--Tits generalized octagon  . . . . . 75--97
          Cheryl E. Praeger and   
                  Shenglin Zhou   Classification of line-transitive
                                  point-imprimitive linear spaces with
                                  line size at most $12$ . . . . . . . . . 99--111
             T. L. Alderson and   
                    A. A. Bruen   Coprimitive sets and inextendable codes  113--124
                      Yves Edel   Sequences in abelian groups $G$ of odd
                                  order without zero-sum subsequences of
                                  length $\exp(G)$ . . . . . . . . . . . . 125--134


Designs, Codes, and Cryptography
Volume 48, Number 1, July, 2008

               Eimear Byrne and   
           Marcus Greferath and   
                  Thomas Honold   Ring geometries, two-weight codes, and
                                  strongly regular graphs  . . . . . . . . 1--16
                Dameng Deng and   
                  Rolf Rees and   
                       Hao Shen   On the existence of nearly Kirkman
                                  triple systems with subsystems . . . . . 17--33
               Landang Yuan and   
                    Qingde Kang   Another construction for large sets of
                                  Kirkman triple systems . . . . . . . . . 35--42
                Sunghyu Han and   
                   Jon-Lark Kim   On self-dual codes over $\mathbb{F}_5$   43--58
                          L. Ji   $2$-idempotent $3$-quasigroups with a
                                  conjugate invariant subgroup consisting
                                  of a single cycle of length four . . . . 59--68
               A. D. Blinco and   
            S. I. El-Zanati and   
            G. F. Seelinger and   
             P. A. Sissokho and   
               L. E. Spence and   
               C. Vanden Eynden   On vector space partitions and uniformly
                                  resolvable designs . . . . . . . . . . . 69--77
                Oded Blayer and   
                    Tamir Tassa   Improved versions of Tardos'
                                  fingerprinting scheme  . . . . . . . . . 79--103
                      Koen Thas   Note on the existence of translation
                                  nets . . . . . . . . . . . . . . . . . . 105--107

Designs, Codes, and Cryptography
Volume 48, Number 2, August, 2008

              Cunsheng Ding and   
              Tor Helleseth and   
          Òyvind Ytrehus   Preface  . . . . . . . . . . . . . . . . 109--110
                  Zihui Liu and   
                 Wende Chen and   
                       Yuan Luo   The relative generalized Hamming weight
                                  of linear $q$-ary codes and their
                                  subcodes . . . . . . . . . . . . . . . . 111--123
                Shu-Tao Xia and   
                    Fang-Wei Fu   Undetected error probability of $q$-ary
                                  constant weight codes  . . . . . . . . . 125--140
            Khmaies Ouahada and   
              Theo G. Swart and   
        Hendrik C. Ferreira and   
                     Ling Cheng   Binary permutation sequences as subsets
                                  of Levenshtein codes, spectral null
                                  codes, run-length limited codes and
                                  constant weight codes  . . . . . . . . . 141--154
            Radinka Yorgova and   
              Alfred Wassermann   Binary self-dual codes with
                                  automorphisms of order $23$  . . . . . . 155--164
        Gerzson Kéri and   
Patric R. J. Östergård   On the minimum size of binary codes with
                                  length $2R + 4$ and covering radius $R$  165--169
             Ernst M. Gabidulin   Attacks and counter-attacks on the GPT
                                  public key cryptosystem  . . . . . . . . 171--177
            Constanza Riera and   
      Stéphane Jacob and   
              Matthew G. Parker   From graph states to two-graph states    179--206

Designs, Codes, and Cryptography
Volume 48, Number 3, September, 2008

           A. J. van Zanten and   
                 Loeky Haryanto   Sets of disjoint snakes based on a
                                  Reed--Muller code and covering the
                                  hypercube  . . . . . . . . . . . . . . . 207--229
             Michel Lavrauw and   
                 Leo Storme and   
         Geertrui Van de Voorde   On the code generated by the incidence
                                  matrix of points and hyperplanes in
                                  ${\rm PG}(n, q)$ and its dual  . . . . . 231--245
             Jong Yoon Hyun and   
                 Hyun Kwang Kim   Maximum distance separable poset codes   247--261
                 Alan R. Prince   Further translation planes of order
                                  $19^2$ admitting ${\rm SL}(2,5)$,
                                  obtained by nest replacement . . . . . . 263--267
                  Andreas Klein   Attacks on the RC4 stream cipher . . . . 269--286
           Hans Ludwig de Vries   On orthogonal resolutions of the
                                  classical Steiner quadruple system ${\rm
                                  SQS}(16)$  . . . . . . . . . . . . . . . 287--292
                 Zheng Gong and   
                 Xuejia Lai and   
                     Kefei Chen   A synthetic indifferentiability analysis
                                  of some block-cipher-based hash
                                  functions  . . . . . . . . . . . . . . . 293--305
           Ulrich Dempwolff and   
              William M. Kantor   Distorting symmetric designs . . . . . . 307--322
                      Olav Geil   On the second weight of generalized
                                  Reed--Muller codes . . . . . . . . . . . 323--330
                   Jianmin Wang   Some combinatorial constructions for
                                  optimal perfect deletion-correcting
                                  codes  . . . . . . . . . . . . . . . . . 331--347