On threshold schemes from large sets

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1996)4:5<323::AID-JCD2>3.0.CO;2-H" /><323::AID-JCD2>3.0.CO;2-H 10.1002/(SICI)1520-6610(1996)4:5<323::AID-JCD2>3.0.CO;2-HzbMath0912.05027OpenAlexW2069905259MaRDI QIDQ4221877

Tuvi Etzion

Publication date: 16 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1996)4:5<323::aid-jcd2>3.0.co;2-h

zbMATH Keywords

secret sharingthreshold schemesH-designslarge sets of Steiner systems

Mathematics Subject Classification ID

Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (5)

Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Probabilistic existence of large sets of designs ⋮ An improved recursive construction for disjoint Steiner quadruple systems ⋮ Maximum sets of mutually disjoint 2-chromatic Steiner quadruple systems ⋮ Large sets with multiplicity

This page was built for publication: On threshold schemes from large sets