scientific article; zbMATH DE number 4104855
From MaRDI portal
Publication:3829472
Recommendations
Cited in
(32)- The fine intersection problem for Steiner triple systems
- Incidence structures applied to cryptography
- Some improved bounds on the information rate of perfect secret sharing schemes
- Further results on large sets of disjoint group-divisible designs
- Anonymous secret sharing schemes
- Optimal ternary constant-composition codes with weight four and distance three
- Further results on 3-spontaneous emission error designs
- Kirkman packing designs KPD(\(\{w,s^{\ast}\},v \)) and related threshold schemes
- Large sets with multiplicity
- A network reliability approach to the analysis of combinatorial repairable 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)\)
- Multicast key distribution schemes based on Stinson-Van Trung designs
- Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
- Bounds on the dimensions of 2-spontaneous emission error designs
- scientific article; zbMATH DE number 4057438 (Why is no real title available?)
- Some New Classes of Geometric Threshold Schemes
- A Combinatorial Approach to Threshold Schemes
- scientific article; zbMATH DE number 68551 (Why is no real title available?)
- Extremal properties of \(t\)-SEEDs and recursive constructions
- On threshold schemes from large sets
- scientific article; zbMATH DE number 1284201 (Why is no real title available?)
- scientific article; zbMATH DE number 1498786 (Why is no real title available?)
- Threshold Schemes Based on Criss-Cross Block Designs
- scientific article; zbMATH DE number 819119 (Why is no real title available?)
- A combinatorial construction for perfect threshold schemes
- A completion of \(LS(2^n4^1)\)
- Revisiting the Karnin, Greene and Hellman Bounds
- Further results on large sets of partitioned incomplete Latin squares
- The existence of large set of symmetric partitioned incomplete latin squares
- Existence of \(\mathrm{LS}^+ (2^n 4^1)\)s
- Constructions for large sets of disjoint compatible packings on 6k+5 points
- Large sets of disjoint packings on \(6k+5\) points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829472)
