Hadamard partitioned difference families and their descendants

DOI10.1007/s12095-018-0308-3zbMath1415.05024arXiv1705.04716OpenAlexW2784011404MaRDI QIDQ2311416

Marco Buratti

Publication date: 10 July 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.04716

zbMATH Keywords

Hadamard difference setpartitioned difference familystrong difference family

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)

Related Items

Cyclic balanced sampling plans excluding contiguous units with block size four, Three classes of partitioned difference families and their optimal constant composition codes, Partitioned difference families and harmonious linear spaces, The preimage distributions of a class of zero-difference balanced functions and their partitioned difference families, Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes, Existence of strong difference families and constructions for eight new 2‐designs, New 2-designs from strong difference families, On disjoint \((v,k,k-1)\) difference families, On balanced \(( \mathbb{Z}_{4 u} \times \mathbb{Z}_{8 v}, \{4, 5 \}, 1)\) difference packings, On silver and golden optical orthogonal codes, Strong difference families of special types, A new construction of zero-difference balanced functions and two applications, Partitioned difference families versus zero-difference balanced functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic constructions for partitioned difference families with applications: a unified combinatorial approach
• From a 1-rotational RBIBD to a partitioned difference family
• On disjoint \((v,k,k-1)\) difference families
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
• Strong difference families, difference covers, and their applications for relative difference families
• Combinatorial designs and the theorem of Weil on multiplicative character sums
• New 2-designs from strong difference families
• Multifold factorizations of cyclic groups into subsets
• Frame difference families and resolvable balanced incomplete block designs
• Pairwise balanced designs from finite fields
• Sets of zero-difference balanced functions and their applications
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Strong difference families over arbitrary graphs
• Some New Classes of Zero-Difference Balanced Functions