<p>Covering schemes were recently introduced as a generalization of both difference matrices and difference schemes, providing an efficient method for building covering arrays with a certain degree of symmetry. On the other hand, Tang and Woo (1983) showed that sets of constant-weight tuples yield several upper bounds on covering arrays. However, these sets usually do not have enough symmetry to induce good covering schemes. In this work, we derive a classification of invariant sets of constant-weight tuples under the action of the diagonal group of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb {Z}_q^k\)</EquationSource> </InlineEquation>. This classification enables us to obtain new upper bounds on covering scheme numbers, including the exact class for binary covering scheme numbers with <i>k</i> columns and strength <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(k-2.\)</EquationSource> </InlineEquation></p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A classification of invariant sets of constant-weight tuples and applications to covering schemes

  • André G. Castoldi,
  • Anderson N. Martinhão,
  • Emerson L. Monte Carmelo,
  • Pablo H. Perondi,
  • Otávio J. N. T. N. dos Santos

摘要

Covering schemes were recently introduced as a generalization of both difference matrices and difference schemes, providing an efficient method for building covering arrays with a certain degree of symmetry. On the other hand, Tang and Woo (1983) showed that sets of constant-weight tuples yield several upper bounds on covering arrays. However, these sets usually do not have enough symmetry to induce good covering schemes. In this work, we derive a classification of invariant sets of constant-weight tuples under the action of the diagonal group of \(\mathbb {Z}_q^k\) . This classification enables us to obtain new upper bounds on covering scheme numbers, including the exact class for binary covering scheme numbers with k columns and strength \(k-2.\)