| Bounds on the length of disjunctive codes AG D'yachkov, VV Rykov Problemy Peredachi Informatsii 18 (3), 7-13, 1982 | 280 | 1982 |
| Families of finite sets in which no intersection of ℓ sets is covered by the union of s others A D'yachkov, P Vilenkin, D Torney, A Macula Journal of Combinatorial Theory, Series A 99 (2), 195-218, 2002 | 105 | 2002 |
| New constructions of superimposed codes AG D'yachkov, AJ Macula, VV Rykov IEEE Transactions on Information Theory 46 (1), 284-290, 2000 | 89 | 2000 |
| A construction of pooling designs with some happy surprises A D'yachkov, F Hwang, A Macula, P Vilenkin, C Weng Journal of Computational Biology 12 (8), 1129-1136, 2005 | 72 | 2005 |
| Exordium for DNA codes AG D'yachkov, PL Erdös, AJ Macula, VV Rykov, DC Torney, CS Tung, ... Journal of Combinatorial Optimization 7 (4), 369-379, 2003 | 58 | 2003 |
| New applications and results of superimposed code theory arising from the potentialities of molecular biology AG D’yachkov, AJ Macula, VV Rykov Numbers, information and complexity, 265-282, 2000 | 54 | 2000 |
| Lectures on designing screening experiments AG D'yachkov arXiv preprint arXiv:1401.7505, 2014 | 51 | 2014 |
| Optimal superimposed codes and designs for Renyi's search model AG D'yachkov, VV Rykov Journal of Statistical Planning and Inference 100 (2), 281-302, 2002 | 47 | 2002 |
| Two models of nonadaptive group testing for designing screening experiments AG D’yachkov, AJ Macula, DC Torney, PA Vilenkin mODa 6—Advances in Model-Oriented Design and Analysis, 63-75, 2001 | 41 | 2001 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50 (1), 27-56, 2014 | 40* | 2014 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50 (1), 27-56, 2014 | 39 | 2014 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50 (1), 27-56, 2014 | 39 | 2014 |
| Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e-Disjunct Inclusion Matrices AG D’yachkov, AJ Macula, PA Vilenkin Entropy, search, complexity, 71-83, 2007 | 39 | 2007 |
| Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices AG D’yachkov, AJ Macula, PA Vilenkin Entropy, search, complexity, 71-83, 2007 | 39 | 2007 |
| On a coding model for a multiple-access adder channel AG D'yachkov, VV Rykov Problemy Peredachi Informatsii 17 (2), 26-38, 1981 | 38 | 1981 |
| A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes AG D’yachkov, AJ Macula, WK Pogozelski, TE Renz, VV Rykov, ... International Workshop on DNA-Based Computers, 90-103, 2004 | 30 | 2004 |
| New results in the theory of superimposed codes AG D’yachkov, A Macula, DC Torney, P Vilenkin, S Yekhanin Proceedings of ACCT-7, Bansko, Bulgaria, 126-136, 2000 | 30 | 2000 |
| Upper bounds on the rate of superimposed (s, l)-codes based on engel’s inequality A D’yachkov, P Vilenkin, S Yekhanin Proceedings of the International Conf. on Algebraic and Combinatorial Coding …, 2002 | 29 | 2002 |
| Free energy gap and statistical thermodynamic fidelity of DNA codes MA Bishop, AG D'yachkov, AJ Macula, TE Renz, VV Rykov Journal of Computational Biology 14 (8), 1088-1104, 2007 | 28 | 2007 |
| Probl. Peredachi Inf. 9, 3 (1973) AS Holevo Probl. Inf. Transm 9, 110, 1973 | 28 | 1973 |
Anthony MaculaSUNY GeneseoVerified email at geneseo.edu
