Augmentation of Covering Arrays of Strength Two

被引:0
|
作者
Charles J. Colbourn
机构
[1] Arizona State University,School of Computing, Informatics, and Decision Systems Engineering
[2] Beihang University,State Key Laboratory of Software Development Environment
来源
Graphs and Combinatorics | 2015年 / 31卷
关键词
Covering array; Augmentation; Kruskal–Katona theorem;
D O I
暂无
中图分类号
学科分类号
摘要
Augmentation is an operation to increase the number of symbols in a covering array, without unnecessarily increasing the number of rows. For covering arrays of strength two, one type of augmentation forms a covering array on v\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v$$\end{document} symbols from one on v-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v-1$$\end{document} symbols together with v-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v-1$$\end{document} covering arrays each on two symbols. A careful analysis of the structure of the optimal binary covering arrays underlies an augmentation operation that reduces the number of rows required. Consequently a number of covering array numbers are improved.
引用
收藏
页码:2137 / 2147
页数:10
相关论文
共 50 条
  • [31] Perfect sequence covering arrays
    Raphael Yuster
    Designs, Codes and Cryptography, 2020, 88 : 585 - 593
  • [32] Problems and algorithms for covering arrays
    Hartman, A
    Raskin, L
    DISCRETE MATHEMATICS, 2004, 284 (1-3) : 149 - 156
  • [33] A Permutation Representation of Covering Arrays
    Dougherty, Ryan E.
    Jiang, Xi
    2021 IEEE/ACM INTERNATIONAL WORKSHOP ON GENETIC IMPROVEMENT (GI 2021), 2021, : 41 - 42
  • [34] Perfect sequence covering arrays
    Yuster, Raphael
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (03) : 585 - 593
  • [35] COVERING PERFECT HASH FAMILIES AND COVERING ARRAYS OF HIGHER INDEX
    Colbourn, Charles j.
    INTERNATIONAL JOURNAL OF GROUP THEORY, 2024, 13 (03) : 293 - 305
  • [36] Covering Arrays Generation Methods Survey
    Kuliamin, Victor
    Petukhov, Alexander
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION, AND VALIDATION, PT II, 2010, 6416 : 382 - 396
  • [37] Graphical methods for evaluating covering arrays
    Kim, Youngil
    Jang, Dae-Heung
    Anderson-Cook, Christine M.
    QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2016, 32 (04) : 1467 - 1481
  • [38] GAMIPOG: A DETERMINISTIC GENETIC MULTI-PARAMETER-ORDER STRATEGY FOR THE GENERATION OF VARIABLE STRENGTH COVERING ARRAYS
    Younis, M., I
    JOURNAL OF ENGINEERING SCIENCE AND TECHNOLOGY, 2020, 15 (05): : 3142 - 3161
  • [39] New Families of Strength-3 Covering Arrays Using Linear Feedback Shift Register Sequences
    Shokri, Kianoosh
    Moura, Lucia
    JOURNAL OF COMBINATORIAL DESIGNS, 2025, 33 (04) : 156 - 171
  • [40] Covering arrays with mixed alphabet sizes
    Moura, L
    Stardom, J
    Stevens, B
    Williams, A
    JOURNAL OF COMBINATORIAL DESIGNS, 2003, 11 (06) : 413 - 432