New results on optimal (v, 4, 2, 1) optical orthogonal codes

Strong difference families, difference covers, and their applications for relative difference families

(2009) Koji Momihara   DESIGNS CODES AND CRYPTOGRAPHY

Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3

(2009) Miwako Mishima et al.   DESIGNS CODES AND CRYPTOGRAPHY

On cyclic 2(k−1)-support (n,k)k−1 difference families

(2009) Koji Momihara   FINITE FIELDS AND THEIR APPLICATIONS

Combinatorial designs and the theorem of Weil on multiplicative character sums

(2009) Marco Buratti et al.   FINITE FIELDS AND THEIR APPLICATIONS

Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes

(2009) Koji Momihara et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Geometric constructions of optimal optical orthogonal codes

(2008) T. Alderson et al.   Advances in Mathematics of Communications

Families of Optimal OOCs With $\lambda = 2$

(2008) Tim L. Alderson et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ=2

(2008) Tao Feng et al.   JOURNAL OF COMBINATORIAL THEORY SERIES A