Jul 6, 2008 · The smallest size of a blocker set X will be denoted by α ( m , k ) and the corresponding blocker set will be called a minimal blocker.
Blocker sets, orthogonal arrays and their application to combination locks · Authors. Alphonse Baartmans, Michigan Technological University · Document Type.
Using orthogonal arrays, we obtain precise numbers α(m,k) (and lower bounds in other cases) for a large number of values of both k and m. The case k=2 that is ...
Blocker sets, orthogonal arrays and their application to combination locks. Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dm ...
Baartmansa, Alphonse ; Sane, Sharad (2008) Blocker sets, orthogonal arrays and their application to combination locks Discrete Mathematics, 308 (13). pp.
Some results on the Ryser design conjecture-III · Tushar D. Parulekar · February 2022 ; Blocker sets, orthogonal arrays and their application to combination locks.
Article. Baartmansa, Alphonse ; Sane, Sharad (2008) Blocker sets, orthogonal arrays and their application to combination locks Discrete Mathematics, 308 (13).
Michigan Technological University Publications | Michigan ...
digitalcommons.mtu.edu › index.115.html
... Blocker sets, orthogonal arrays and their application to combination locks, Alphonse Baartmans and Sharad Sane. Link · Lymantria dispar herbivory induces rapid ...
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, ...
Orthogonal arrays are beautiful and useful. They are essential in statistics and they are used in computer science and cryptography.