Disjoint difference families and their applications
From MaRDI portal
Publication:908044
Abstract: Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families and the variations in priorities in constructions. We propose a definition of disjoint difference families that encompasses these variations and allows a comparison of the similarities and disparities. We then focus on two constructions of disjoint difference families arising from frequency hopping sequences and showed that they are in fact the same. We conclude with a discussion of the notion of equivalence for frequency hopping sequences and for disjoint difference families.
Recommendations
- On disjoint \((v,k,k-1)\) difference families
- Complete sets of disjoint difference families and their applications
- The existence of \((v,4,\lambda)\) disjoint difference families
- scientific article; zbMATH DE number 1123805
- Constructions of external difference families and disjoint difference families
Cites work
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 1982612 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- A new class of 3-fold perfect splitting authentication codes
- A new class of optimal 3-splitting authentication codes
- A new class of splitting 3-designs
- A new frequency-hopping sequence set based upon generalized cyclotomy
- Algebraic manipulation detection codes
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Almost optimum \(t\)-cheater identifiable secret sharing schemes
- Almost optimum secret sharing schemes with cheating detection for random bit strings
- Authentication codes and combinatorial designs.
- Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes
- Cheating detectable secret sharing schemes supporting an arbitrary finite field
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
- Combinatorial bounds and characterizations of splitting authentication codes
- Combinatorial bounds on authentication codes with arbitration.
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
- Combinatorial designs for authentication and secrecy codes
- Combinatorial problems motivated by comma‐free codes
- Comma-Free Codes
- Complete sets of disjoint difference families and their applications
- Construction of optimal sets of frequency hopping sequences
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Cyclic Whist tournaments
- Design of Strongly Secure Communication and Computation Channels by Nonlinear Error Detecting Codes
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Detection of algebraic manipulation in the presence of leakage
- Difference systems of sets and code synchronization
- Families of sequences with optimal Hamming-correlation properties
- Flaws in Some Secret Sharing Schemes Against Cheating
- Further results on the existence of splitting BIBDs and application to authentication codes
- General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
- High-Rate Self-Synchronizing Codes
- How to share a secret with cheaters
- Information-Theoretic Security Without an Honest Majority
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- New Families of Optimal Frequency Hopping Sequence Sets
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Non-Overlapping Codes
- Non-malleable codes
- On a fallacious bound for authentication codes
- Optical orthogonal codes: design, analysis and applications
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- Optimal algebraic manipulation detection codes in the constant-error model
- Optimal rate code constructions for computationally simple channels
- Optimum PN Sequences for CDMA Systems
- Optimum Secret Sharing Scheme Secure against Cheating
- Restrictions and generalizations on comma-free codes
- Secret sharing schemes with detection of cheaters for a general access structure
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
- The CRC handbook of combinatorial designs
- Three constructions of authentication codes with perfect secrecy
Cited in
(9)- Construction of three classes of strictly optimal frequency-hopping sequence sets
- Disjoint difference families from Galois rings
- On optimal weak algebraic manipulation detection codes and weighted external difference families
- New cyclic difference sets with Singer parameters constructed from \(d\)-homogeneous functions
- Internal and external partial difference families and cyclotomy
- Existence and non-existence results for strong external difference families
- The existence of \((\mathbb{Z}_v,4,1)\)-disjoint difference families
- Near-complete external difference families
- A note on difference families from cyclotomy
This page was built for publication: Disjoint difference families and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908044)
