Faced with a large number of samples to be tested, if there are requiring to be tested one by one and complete in a short time, it is difficult to save time and save costs at the same time. The random pooling designs can deal with it to some degree. In this paper, a family of random pooling designs based on the singular linear spaces and related counting theorems are constructed. Furtherly, based on it we construct an $ \alpha $-$ almost\ d^e $-disjunct matrix and an $ \alpha $-$ almost\ (d, r, z] $-disjunct matrix, and all the parameters and properties of these random pooling designs are given. At last, by comparing to Li's construction, we find that our design is better under certain condition.
Citation: Xuemei Liu, Yazhuo Yu. Construction of random pooling designs based on singular linear space over finite fields[J]. AIMS Mathematics, 2022, 7(3): 4376-4385. doi: 10.3934/math.2022243
Faced with a large number of samples to be tested, if there are requiring to be tested one by one and complete in a short time, it is difficult to save time and save costs at the same time. The random pooling designs can deal with it to some degree. In this paper, a family of random pooling designs based on the singular linear spaces and related counting theorems are constructed. Furtherly, based on it we construct an $ \alpha $-$ almost\ d^e $-disjunct matrix and an $ \alpha $-$ almost\ (d, r, z] $-disjunct matrix, and all the parameters and properties of these random pooling designs are given. At last, by comparing to Li's construction, we find that our design is better under certain condition.
| [1] |
A. J. Macula, A simple construction of d-disjunct matrices with certain constant weights, Discrete Math., 162 (1996), 311–312. https://doi.org/10.1016/0012-365X(95)00296-9 doi: 10.1016/0012-365X(95)00296-9
|
| [2] |
A. J. Macula, V. V. Rykov, S. Yekhanin, Trivial two-stage group testing for complexes using almost disjunct matrices, Discrete Appl. Math., 137 (2004), 97–107. https://doi.org/10.1016/S0166-218X(03)00191-4 doi: 10.1016/S0166-218X(03)00191-4
|
| [3] |
A. J. Macula, L. J. Popyack, A group testing method for finding patterns in data, Discrete Appl. Math., 144 (2004), 149–157. https://doi.org/10.1016/j.jmatprotec.2004.09.023 doi: 10.1016/j.jmatprotec.2004.09.023
|
| [4] | W. Lang, Y. Wang, J. Yu, S. Gao, W. Wu, Error-tolerant trivial two-stage group testing for complexes using almost separable and almost disjunct matrices, Discrete Math. Algorit., 1 (2009), 235–251. |
| [5] |
H. Shi, W. Rui, Construction and properties of a class of random d-disjunct matrices, Math. Pract. Theory, 48 (2018), 306–310. https://doi.org/10.1515/hzhz-2018-0007 doi: 10.1515/hzhz-2018-0007
|
| [6] |
Y. Li, S. Wang, J. Liu, Random pooling designs under the binary superposition code $M_q(n, k, d)$, Math. Pract. Theory, 49 (2019), 310–314. https://doi.org/10.1177/0049085719844117 doi: 10.1177/0049085719844117
|
| [7] |
K. Wang, J. Guo, F. Li, Singular linear space and its applications, Finite Fields Th. App., 17 (2011), 395–406. https://doi.org/10.4000/geomorphologie.9607 doi: 10.4000/geomorphologie.9607
|
| [8] | Z. Wan, Geometry of classical groups over finite fields, 2 Eds., New York: Science Press, 2002. |
| [9] |
J. Guo, K. Wang, Pooling designs with surprisingly high degree of error correction in a finite vector space, Discrete Appl. Math., 160 (2012), 2172–2176. https://doi.org/10.1016/j.dam.2012.05.018 doi: 10.1016/j.dam.2012.05.018
|
Xuemei Liu, Yazhuo Yu. Construction of random pooling designs based on singular linear space over finite fields[J]. AIMS Mathematics, 2022, 7(3): 4376-4385. doi: 10.3934/math.2022243
DownLoad: