Partitioned difference families versus zero-difference balanced functions
From MaRDI portal
Publication:2329390
DOI10.1007/s10623-019-00632-xzbMath1422.05025OpenAlexW2937983435MaRDI QIDQ2329390
Marco Buratti, Dieter Jungnickel
Publication date: 17 October 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00632-x
relative difference familydisjoint difference familypartitioned difference familyzero-difference balanced function
Related Items (4)
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 ⋮ Partitioned difference families: the storm has not yet passed
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Block disjoint difference families for Steiner triple systems: \(v\equiv 3 \mod 6\)
- On disjoint \((3t,3,1)\) cyclic difference families
- Transversal designs associated with Frobenius groups
- Difference families from rings
- Composition theorems for difference families and regular planes
- Two new classes of difference families
- Pairwise balanced designs from finite fields
- Hadamard partitioned difference families and their descendants
- A new construction of zero-difference balanced functions and two applications
- Disjoint difference families from Galois rings
- Cyclotomy and difference families in elementary Abelian groups
- Three New Families of Zero-Difference Balanced Functions With Applications
- Localized Error Correction in Projective Space
- Combinatorial Constructions of Optimal Constant-Composition Codes
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- On simple radical difference families
- Solving isomorphism problems about 2‐designs from disjoint difference families
This page was built for publication: Partitioned difference families versus zero-difference balanced functions
