摘要
本文对B-d模型说明了n_k(d)(d≥3)不可能达到其信息论上界,给出并证明了对任意d≤2~k,n_k(d)具有相同的上界,且该上界是可达的,并构造了达到该上界的试验序列,即B-d模型的最优试验序列。
With B-d model demonstrates that n_k(d)(d≥3) cannot reach an information upper bound and proves the hypothesis that n_k(d) (d≥3) possesses a same upperbound for any d≤2~k. This upperbound is achievable and a testing sequence for achieving this upperbound, i. e. the optimal testing sequence for B-d model, is constructed.
关键词
群试
试验序列
模型
Groups Testing
Test Sequences
Solution Space
Model
