Disjoint difference families and their applications
From MaRDI portal
Publication:908044
DOI10.1007/S10623-015-0149-4zbMATH Open1355.94106DBLPjournals/dcc/NgP16arXiv1509.05255OpenAlexW2240701896WikidataQ59476875 ScholiaQ59476875MaRDI QIDQ908044FDOQ908044
Authors: Siaw-Lynn Ng, Maura Paterson 
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1509.05255
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
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial structures in finite projective spaces (51E20) Authentication, digital signatures and secret sharing (94A62) Applications of design theory to circuits and networks (94C30)
Cites Work
- The CRC handbook of combinatorial designs
- Title not available (Why is that?)
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- Title not available (Why is that?)
- Authentication codes and combinatorial designs.
- Title not available (Why is that?)
- Non-Malleable Codes
- Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
- How to share a secret with cheaters
- On a fallacious bound for authentication codes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Combinatorial bounds on authentication codes with arbitration.
- A new class of 3-fold perfect splitting authentication codes
- Comma-Free Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
- Optical orthogonal codes: design, analysis and applications
- General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- Families of sequences with optimal Hamming-correlation properties
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- Combinatorial problems motivated by comma‐free codes
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Difference systems of sets and code synchronization
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes
- A new class of splitting 3-designs
- Combinatorial bounds and characterizations of splitting authentication codes
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Complete sets of disjoint difference families and their applications
- A new class of optimal 3-splitting authentication codes
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Further results on the existence of splitting BIBDs and application to authentication codes
- A new frequency-hopping sequence set based upon generalized cyclotomy
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Combinatorial designs for authentication and secrecy codes
- Optimum Secret Sharing Scheme Secure against Cheating
- Secret sharing schemes with detection of cheaters for a general access structure
- Cyclic Whist tournaments
- Three constructions of authentication codes with perfect secrecy
- Restrictions and generalizations on comma-free codes
- Non-Overlapping Codes
- Algebraic manipulation detection codes
- Detection of Algebraic Manipulation in the Presence of Leakage
- High-Rate Self-Synchronizing Codes
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Almost optimum secret sharing schemes with cheating detection for random bit strings
- Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes
- Construction of optimal sets of frequency hopping sequences
- Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
- New Families of Optimal Frequency Hopping Sequence Sets
- Almost optimum \(t\)-cheater identifiable secret sharing schemes
- Optimal Rate Code Constructions for Computationally Simple Channels
- Information-Theoretic Security Without an Honest Majority
- Flaws in Some Secret Sharing Schemes Against Cheating
- Title not available (Why is that?)
- Optimum PN Sequences for CDMA Systems
- Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field
- Design of Strongly Secure Communication and Computation Channels by Nonlinear Error Detecting Codes
Cited In (9)
- Construction of three classes of strictly optimal frequency-hopping sequence sets
- Existence and non-existence results for strong external difference families
- Internal and external partial difference families and cyclotomy
- Near-complete external difference families
- A note on difference families from cyclotomy
- The existence of \((\mathbb{Z}_v,4,1)\)-disjoint difference families
- On optimal weak algebraic manipulation detection codes and weighted external difference families
- New cyclic difference sets with Singer parameters constructed from \(d\)-homogeneous functions
- Disjoint difference families from Galois rings
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)
