Hadamard partitioned difference families and their descendants
From MaRDI portal
Publication:2311416
DOI10.1007/s12095-018-0308-3zbMath1415.05024arXiv1705.04716MaRDI QIDQ2311416
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
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
94B25: Combinatorial codes
Related Items
On silver and golden optical orthogonal codes, Partitioned difference families and harmonious linear spaces, On disjoint \((v,k,k-1)\) difference families, New 2-designs from strong difference families, On balanced \(( \mathbb{Z}_{4 u} \times \mathbb{Z}_{8 v}, \{4, 5 \}, 1)\) difference packings, Cyclic balanced sampling plans excluding contiguous units with block size four, Three classes of partitioned difference families and their optimal constant composition 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
