Hadamard partitioned difference families and their descendants
Marco Buratti

TL;DR
This paper introduces a doubling construction for Hadamard-type partitioned difference families, expanding the class of such families and providing new infinite families with specific parameters based on Hadamard difference sets.
Contribution
It presents a novel doubling construction method for Hadamard-type PDFs, enabling the generation of infinite classes of these families from existing ones.
Findings
Constructed an infinite class of PDFs from Hadamard difference sets.
Derived PDFs with specific parameters related to prime power divisors.
Extended the theory of difference families with new combinatorial structures.
Abstract
If is a Hadamard difference set (HDS) in , then is clearly a partitioned difference family (PDF). Any -PDF will be said of Hadamard-type if as the one above. We present a doubling construction which, starting from any such PDF, leads to an infinite class of PDFs. As a special consequence, we get a PDF in a group of order and three block-sizes , and , whenever we have a -HDS and the maximal prime power divisors of are all greater than .
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
