A combinatorial construction for perfect threshold schemes
From MaRDI portal
Publication:5017858
DOI10.1360/012013-36zbMath1488.05042OpenAlexW2335358108MaRDI QIDQ5017858
Miao Liang, Beiliang Du, Mingchao Li
Publication date: 17 December 2021
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1360/012013-36
optimal threshold schemepartitionable group divisible \(t\)-designpartitionable partially balanced \(t\)-design
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Related Items (5)
\(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs ⋮ The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$ ⋮ Decomposable super‐simple BIBDs with block size 4 and index 4, 6 ⋮ Decomposable super‐simple NRBIBDs with block size 4 and index 6 ⋮ Super-simple BIBDs with block size 4 and index 7
This page was built for publication: A combinatorial construction for perfect threshold schemes
