Optimal ordered covering arrays via an exact algorithm

MaRDI QIDQ6612041zbMATH OpenFDO

Authors Ludwig Kampel, Dimitris Simos

Publication date 27 September 2024

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

covering arrayscovering codesSAT solving

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Bounds on codes (94B65)

Recommendations

• Ordered covering arrays and upper bounds on covering codes
• Bounds on covering codes in RT spaces using ordered covering arrays
• New optimal covering arrays using an orderly algorithm
• Bounds on ordered codes and orthogonal arrays
• Covering arrays via set covers

Cited in

(1)

• Ordered covering arrays and upper bounds on covering codes

This page was built for publication: Optimal ordered covering arrays via an exact algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612041)