scientific article

zbMath0758.05033MaRDI QIDQ4014422

D. Chen, Douglas R. Stinson

Publication date: 13 October 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial designpartial informationshadowstheshold schemes

Mathematics Subject Classification ID

Hypergraphs (05C65) Other designs, configurations (05B30)

Related Items

Anonymous secret sharing schemes ⋮ Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Extremal properties of \(t\)-SEEDs and recursive constructions ⋮ Further results on large sets of partitioned incomplete Latin squares ⋮ The existence of large set of symmetric partitioned incomplete latin squares ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ A completion of \(LS(2^n4^1)\) ⋮ Some improved bounds on the information rate of perfect secret sharing schemes ⋮ Further results on large sets of disjoint group-divisible designs ⋮ Large sets of disjoint packings on \(6k+5\) points ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ Further results on 3-spontaneous emission error designs ⋮ Bounds on the Dimensions of 2-Spontaneous Emission Error Designs ⋮ Kirkman packing designs KPD(\(\{w,s^{\ast}\},v \)) and related threshold schemes ⋮ Constructions of large sets of disjoint group-divisible designs \(\mathrm{LS}(2^n 4^1)\) using a generalization of \(^*\mathrm{LS}(2^n)\)