18 citations · 62 across the 17 of their papers we have counts for
10 papers · 1 filter
Sets of mutually orthogoval projective and affine planes
Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab +3
A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at…
Balanced and Swap-Robust Trades for Dynamical Distributed Storage
Chao Pan, Ryan Gabrys, Xujun Liu +2
Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their con…
Distributing hash families with few rows
Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for…
Disjoint spread systems and fault location
Charles J. Colbourn, Bingli Fan, Daniel Horsley
When factors each taking one of levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and det…
Constructions of optimal orthogonal arrays with repeated rows
Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch
We construct orthogonal arrays OA (of strength two) having a row that is repeated times, where is as large as possible. In particular, we consider OAs where the r…
New bounds on the maximum size of Sperner partition systems
Yanxun Chang, Charles J. Colbourn, Adam Gowty +2
An -Sperner partition system is a collection of partitions of some -set, each into nonempty classes, such that no class of any partition is a subset of a class of any…