Generic constructions for partitioned difference families with applications: a unified combinatorial approach
From MaRDI portal
Publication:510413
DOI10.1007/S10623-016-0182-YzbMath1355.05062OpenAlexW2281552948MaRDI QIDQ510413
Shuxing Li, Gennian Ge, Hengjia Wei
Publication date: 17 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0182-y
difference matricesconstant composition codespartitioned difference familiespartitioned relative difference familiesrecursive constructions
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)
Related Items (11)
Three classes of partitioned difference families and their optimal constant composition codes ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ 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 ⋮ A generic method to construct zero-difference balanced functions ⋮ On disjoint \((v,k,k-1)\) difference families ⋮ Frame difference families and resolvable balanced incomplete block designs ⋮ Hadamard partitioned difference families and their descendants ⋮ 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
- Unnamed Item
- From a 1-rotational RBIBD to a partitioned difference family
- Partitioned difference families and almost difference sets
- Complete sets of disjoint difference families and their applications
- Constructions of external difference families and disjoint difference families
- Further combinatorial constructions for optimal frequency-hopping sequences
- Constructions of partitioned difference families
- Optimal and perfect difference systems of sets
- Constructions for optimal optical orthogonal codes
- Zero-difference balanced functions with applications
- Sets of zero-difference balanced functions and their applications
- Cyclotomy and difference families in elementary Abelian groups
- Cyclotomic Constructions of Zero-Difference Balanced Functions With Applications
- Three New Families of Zero-Difference Balanced Functions With Applications
- Combinatorial Constructions of Optimal Constant-Composition Codes
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- On constant-composition codes over Z/sub q/
- Algebraic Constructions of Optimal Frequency-Hopping Sequences
- Sets of Optimal Frequency-Hopping Sequences
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Some New Classes of Zero-Difference Balanced Functions
- A New Construction of Zero-Difference Balanced Functions and Its Applications
This page was built for publication: Generic constructions for partitioned difference families with applications: a unified combinatorial approach
