Discrete Mathematics, Volume 83

Volume 83, Number 1, July 1990

• Stephen D. Cohen:
  Primitive elements and polynomials with arbitrary trace. 1-7
  
• Charles J. Colbourn, Ebadollah S. Mahmoodian:
  The spectrum of support sizes for threefold triple systems. 9-19
  
• Yahya Ould Hamidoune:
  Connectivite des graphes de cayley abeliens sans K₄. 21-26
  
• Ivor J. Johnston:
  Some results involving multilattice ideals and distributivity. 27-35
  
• Esther R. Lamken, Scott A. Vanstone:
  Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. 37-47
  
• Sean McGuinness, Rolf S. Rees:
  On the number of distinct minimal clique partitions and clique covers of a line graph. 49-62
  
• Don Rawlings:
  Multicolored permutations, sequences, and tableaux. 63-79
  
• Rolf S. Rees, Douglas R. Stinson:
  On the number of blocks in a perfect covering of upsilon points. 81-93
  
• Petr Savický:
  Random boolean formulas representing any boolean function with asymptotically equal probability. 95-103
  
• Dennis Stanton, Dennis E. White:
  Combinatorics of the z^AB theorem. 105-114
  
• Andries E. Brouwer:
  A note on completely regular codes. 115-117
  
• Takayuki Hibi:
  Some results on ehrhart polynomials of convex polytopes. 119-121
  
• Jin Akiyama, Jorge Urrutia:
  A note on balanced colourings for lattice points. 123-126
  
• J. L. Alperin:
  Trees and Brauer trees. 127-128
  
• Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman:
  Sphere coverings of the hypercube with incomparable centers. 129-134
  

Volume 83, Numbers 2-3, August 1990

• Vera Pless:
  Preface. 137
  
• Matti Aaltonen:
  A new upper bound on nonbinary block codes. 139-160
  
• E. F. Assmus Jr., Jennifer D. Key:
  Affine and projective planes. 161-187
  
• Richard A. Brualdi, Vera Pless:
  On the covering radius of a code and its subcodes. 189-199
  
• A. Robert Calderbank, Peter Frankl:
  Binary codes and quasi-symmetric designs. 201-204
  
• Ying Cheng, N. J. A. Sloane:
  The automorphism group of an [18, 9, 8] quaternary code. 205-212
  
• John H. Conway, Samuel J. Lomonaco, N. J. A. Sloane:
  A [45, 13] code with minimal distance 16. 213-217
  
• John H. Conway:
  Integral lexicographic codes. 219-235
  
• Gérard D. Cohen:
  Applications of coding theory to communication combinatorial problems. 237-248
  
• Ferdinand Hergert:
  On the delsarte-goethals codes and their formal duals. 249-263
  
• W. Cary Huffman:
  On the equivalence of codes and codes with an automorphism having two cycles. 265-283
  
• Stoyan N. Kapralov, Vladimir D. Tonchev:
  Extremal doubly-even codes of length 64 derived from symmetric designs. 285-289
  
• Helmut Koch:
  On self-dual doubly-even extremal codes. 291-300
  
• Mao Chao Lin, Shu Lin:
  Codes with multi-level error-correcting capabilities. 301-314
  
• Harold N. Ward:
  Weight polarization and divisibility. 315-326