In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 <= t <= 50 using computer programs, which are useful in recursive constructions for cyclic designs. Applications of these designs to optical orthogonal codes are also mentioned.
机构:
Sapienza Univ Roma, Dipartimento Sci Base & Applicate Ingn SBAI, Via Antonio Scarpa,10,Pal A, I-00161 Rome, ItalySapienza Univ Roma, Dipartimento Sci Base & Applicate Ingn SBAI, Via Antonio Scarpa,10,Pal A, I-00161 Rome, Italy
机构:
Arizona State Univ, Sch Comp & Augmented Intelligence, Tempe, AZ 85287 USAArizona State Univ, Sch Comp & Augmented Intelligence, Tempe, AZ 85287 USA
Colbourn, Charles J.
NEW ADVANCES IN DESIGNS, CODES AND CRYPTOGRAPHY, NADCC 2022,
2024,
86
: 63
-
75