Circular external difference families, graceful labellings and cyclotomy
From MaRDI portal
Publication:6570033
DOI10.1016/J.DISC.2024.114103zbMATH Open1543.05013MaRDI QIDQ6570033FDOQ6570033
Authors: Maura Paterson, D. R. Stinson 
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Circular external difference families: construction and non-existence
- Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families
- Cyclotomic construction of strong external difference families in finite fields
- Cyclotomic constructions of external difference families and disjoint difference families
- Construction and nonexistence of strong external difference families
Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Cyclotomy (11T22)
Cites Work
- How to share a secret
- Cyclic codes from cyclotomic sequences of order four
- Optimum Secret Sharing Scheme Secure against Cheating
- New families of graphs that have \(\alpha\)-labelings
- Title not available (Why is that?)
- On Graceful Directed Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring groups into subsets.
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Partitionable graphs arising from near-factorizations of finite groups
- Cyclotomic construction of strong external difference families in finite fields
- New existence and nonexistence results for strong external difference families
- Existence and non-existence results for strong external difference families
- Construction and nonexistence of strong external difference families
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
- Cayley partitionable graphs and near-factorizations of finite groups
- Strong external difference families in abelian and non-abelian groups
- Nonexistence of strong external difference families in abelian groups of order being product of at most three primes
- Some nonexistence results for \((v,m,k,pq)\)-strong external difference families
- Rotational terraces from rectangular arrays
- Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families
Cited In (1)
This page was built for publication: Circular external difference families, graceful labellings and cyclotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570033)
