Volume 46,
Number 1,
January 2008
- Jinhua Wang, Hao Shen:
Existence of (v, K1(3) union {w*})-PBDs and its applications.
1-16
- Vitaly Skachek, Ron M. Roth:
Probabilistic algorithm for finding roots of linearized polynomials.
17-23
- Veerle Fack, Szabolcs L. Fancsali, Leo Storme, Geertrui Van de Voorde, 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, Shiqu Li:
A coding problem in steganography.
67-81
- James A. Davis, Laurent Poinsot:
G-Perfect nonlinear functions.
83-96
- Sosina Martirosyan, Tran van Trung:
Explicit constructions for perfect hash families.
97-112
- Cunsheng Ding, Tao Feng:
Codebooks from almost difference sets.
113-126
Volume 46,
Number 2,
February 2008
- Norman L. Johnson:
mth -Root subgeometry partitions.
127-136
- Boris Skoric, Stefan Katzenbeisser, Mehmet Utku Celik:
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes.
137-166
- Vito Abatangelo, Bambina Larato:
Elliptic near-MDS codes over F5.
167-174
- Thomas Britz, 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, Jie Yan, Chengmin Wang:
Generalized balanced tournament designs and related codes.
211-230
- Antonio Cossidente, Nicola Durante, Giuseppe Marino, Tim Penttila, Alessandro Siciliano:
The geometry of some two-character sets.
231-241
Volume 46,
Number 3,
March 2008
Copyright © Fri Nov 27 19:04:11 2009
by Michael Ley (ley@uni-trier.de)