Strong difference families of special types
Yanxun Chang, Simone Costa, Tao Feng, Xiaomiao Wang

TL;DR
This paper introduces strong difference families of special types to generate new combinatorial designs and constructs various applications including group divisible designs, rotational BIBDs, and optical orthogonal codes with specific parameters.
Contribution
It presents a novel class of strong difference families and demonstrates their use in constructing multiple combinatorial and optical design structures.
Findings
Constructed group divisible designs of type 30^u with block size 6.
Derived r-rotational BIBDs with block size 6 for r=6,10.
Obtained several classes of optimal optical orthogonal codes with weights 5 to 8.
Abstract
Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type with block size are discussed, -rotational balanced incomplete block designs with block size are derived for , and several classes of optimal optical orthogonal codes with weight , , , or are obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography
