1. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

   • Jaume Martí-Farré
   • Carles Padró

   OriginalPaper 17 January 2009 Pages: 1 - 14

2. Detection and identification of cheaters in (t, n) secret sharing scheme

   • Lein Harn
   • Changlu Lin

   OriginalPaper 11 January 2009 Pages: 15 - 24

3. Linear hash families and forbidden configurations

   • Charles J. Colbourn
   • Alan C. H. Ling

   OriginalPaper 17 January 2009 Pages: 25 - 55

4. On circulant self-dual codes over small fields

   • Markus Grassl
   • T. Aaron Gulliver

   OriginalPaper 06 February 2009 Pages: 57 - 81

5. A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression

   • Yu-Ru Liu
   • Craig V. Spencer

   OriginalPaper 31 January 2009 Pages: 83 - 91

6. Indivisible plexes in latin squares

   • Darryn Bryant
   • Judith Egan
   • Ian M. Wanless

   OriginalPaper 03 February 2009 Pages: 93 - 105

7. Optimal grid holey packings with block size 3 and 4

   • Bin Wen
   • Jianmin Wang
   • Jianxing Yin

   OriginalPaper 13 February 2009 Pages: 107 - 124

8. There exists no self-dual [24,12,10] code over \({{\mathbb F}_5}\)

   • Masaaki Harada
   • Akihiro Munemasa

   OriginalPaper 21 February 2009 Pages: 125 - 127