On threshold schemes from large sets

DOI10.1002/(SICI)1520-6610(1996)4:5%3C323::AID-JCD2%3E3.0.CO;2-HMaRDI QIDQ4221877zbMATH OpenOpenAlexFDO

Authors Tuvi Etzion

Publication date 16 May 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6610(1996)4:5%3C323::aid-jcd2%3E3.0.co;2-h

zbMATH Keywords

H-designslarge sets of Steiner systemssecret sharingthreshold schemes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4104855
• scientific article; zbMATH DE number 4057438
• A Combinatorial Approach to Threshold Schemes
• Threshold Schemes Based on Criss-Cross Block Designs

Cited in

(10)

• Maxisets for \(\mu \) -thresholding rules
• Large sets with multiplicity
• Maximum sets of mutually disjoint 2-chromatic Steiner quadruple systems
• Bounds and constructions of \(t\)-spontaneous emission error designs
• scientific article; zbMATH DE number 4057438 (Why is no real title available?)
• A Combinatorial Approach to Threshold Schemes
• scientific article; zbMATH DE number 4104855 (Why is no real title available?)
• An improved recursive construction for disjoint Steiner quadruple systems
• New nonuniform group divisible designs and mixed Steiner systems
• Constructions for anonymous secret sharing schemes using combinatorial designs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221877)