CAJ | 학술논문

一个大小为N、度为k、取值为v、强度为f的t-维组合覆盖阵是一个N×k矩阵,其取值为v的符号集,并且任意N×t子矩阵的行都至少包含取值为v符号集的任一f元组一次.提出了一种基于差阵的t-维组合覆盖阵代数递归构建新方法,该方法在已有的覆盖阵基础上可大规模地扩展参数个数,实现任意f个参数组合的有效覆盖(t≥2),是一种实用的生成高维组合覆盖阵代数递归新方法.同时,给出了该新方法的理论推导与算法实现.
일개대소위N、도위k、취치위v、강도위f적t-유조합복개진시일개N×k구진,기취치위v적부호집,병차임의N×t자구진적행도지소포함취치위v부호집적임일f원조일차.제출료일충기우차진적t-유조합복개진대수체귀구건신방법,해방법재이유적복개진기출상가대규모지확전삼수개수,실현임의f개삼수조합적유효복개(t≥2),시일충실용적생성고유조합복개진대수체귀신방법.동시,급출료해신방법적이론추도여산법실현.
A t-covering array of size N,degree k,order v and strength t is an N × k array with entries from a set of v symbols such that any N × t subarray contains a t-tuple of v symbols at least once as a row.This paper presents a new algebraic recursive method for constructing coveting arrays based on difference matrices.The method can extend parameter factors on the existing coveting arrays and cover all the combinations of any t parameter factors (t≥2).The method,which recursively generates high strength covering arrays, is practical.Meanwhile,the theoretical derivation and realization of the proposed algebraic recursive algorithm are given.