论文信息 - A simple construction of d-disjunct matrices with certain constant weights

A simple construction of d-disjunct matrices with certain constant weights

Abstract We give a simple method of constructing d -disjunct matrices. For k > d , our construction yields a ( d n ) × ( k n ) d -disjunct matrix with column weight ( d k ) and row weight ( k − d n − d ).

Anthony J. Macula | A. Macula

[1] Zoltán Füredi,et al. Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[2] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[3] Arkadii G. D'yachkov,et al. A survey of superimposed code theory , 1983 .

[4] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .

[5] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .