Scholarlink

<p>We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer–Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are radius-1 completely regular codes (equivalently, intriguing sets, equitable 2-partitions, perfect 2-colorings) in the corresponding multigraph. For the case when the numbers of levels are powers of the same prime number, we characterize, in terms of multispreads, additive mixed-level orthogonal arrays attaining the BF bound. For pure-level orthogonal arrays, we consider versions of the BF bound obtained by replacing the Hamming graph by its polynomial generalization and show that in some cases this gives a new bound.</p>

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

Generalizing the Bierbrauer–Friedman bound for orthogonal arrays

  • 期刊论文

  • 发表日期：

    2025年8月13日

查看全文
  • Denis S. Krotov,
  • Ferruh Özbudak,
  • Vladimir N. Potapov

摘要

We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer–Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are radius-1 completely regular codes (equivalently, intriguing sets, equitable 2-partitions, perfect 2-colorings) in the corresponding multigraph. For the case when the numbers of levels are powers of the same prime number, we characterize, in terms of multispreads, additive mixed-level orthogonal arrays attaining the BF bound. For pure-level orthogonal arrays, we consider versions of the BF bound obtained by replacing the Hamming graph by its polynomial generalization and show that in some cases this gives a new bound.