A note on dynamic threshold schemes
โ Scribed by Carlo Blundo
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 482 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An anonymous ( t , w)-threshold scheme is one of the schemes for secret sharing. Combinatorial designs and especially large sets of Steiner systems and of Steiner systems "with holes" have an important role in the design of perfect ( t , w)-threshold schemes. In this article we investigate perfect (
The Dynamic Relaxation (DR) method of solving a set of simultaneous linear equations requires an estimate of the spectral radius of the matrix. Dividing each equation by the corresponding row sum of moduli of the elements of the matrix gives a convenient upper bound of unity to this. This note shows