TY - JOUR
T1 - Optimal (n,4,2)-OOC of small orders
AU - Chu, Wensong
AU - Colbourn, Charles
N1 - Funding Information:
The authors thank Battiti and Protasi, and Niskanen and Östergård, for making their excellent MCP algorithms available. Without both algorithms, this project would have been much more difficult. Research of the authors is supported by ARO grant DAAD19-01-1-0406.
PY - 2004/3/28
Y1 - 2004/3/28
N2 - In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.
AB - In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.
KW - Cyclic Steiner quadruple systems
KW - Maximal clique problem
KW - Optical orthogonal codes
KW - r-simple matrices
UR - http://www.scopus.com/inward/record.url?scp=1342265864&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1342265864&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(03)00266-8
DO - 10.1016/S0012-365X(03)00266-8
M3 - Article
AN - SCOPUS:1342265864
SN - 0012-365X
VL - 279
SP - 163
EP - 172
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -