| Bounds on the length of disjunctive codes AG D'yachkov, VV Rykov Problemy Peredachi Informatsii 18 (3), 7-13, 1982 | 312 | 1982 |
| A survey of superimposed code theory AG Dyachkov, VV Rykov Problems of Control and Information Theory 12 (4), 1-13, 1983 | 211 | 1983 |
| Superimposed distance codes AG DYACHKOV, VV Rykov, AM Rashad Problems of Control and Information Theory-problemy Upravleniya i Teorii …, 1989 | 170 | 1989 |
| 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 | 113 | 2002 |
| New constructions of superimposed codes AG D'yachkov, AJ Macula, VV Rykov IEEE Transactions on Information Theory 46 (1), 284-290, 2000 | 91 | 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 | 74 | 2005 |
| Exordium for DNA codes AG D'yachkov, PL Erdös, AJ Macula, VV Rykov, DC Torney, CS Tung, ... Journal of Combinatorial Optimization 7, 369-379, 2003 | 60 | 2003 |
| Lectures on designing screening experiments AG D'yachkov arXiv preprint arXiv:1401.7505, 2014 | 57 | 2014 |
| 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 | 53 | 2000 |
| 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 | 49 | 2002 |
| Random constant composition codes for multiple access channels AG Dyachkov Probl. of Control and Inform. Theory 13, 357-369, 1984 | 45 | 1984 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50, 27-56, 2014 | 43* | 2014 |
| On a coding model for a multiple-access adder channel AG D'yachkov, VV Rykov Problemy Peredachi Informatsii 17 (2), 26-38, 1981 | 42 | 1981 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50, 27-56, 2014 | 41 | 2014 |
| Bounds on the rate of disjunctive codes AG D’yachkov, IV Vorob’ev, NA Polyansky, VY Shchukin Problems of Information Transmission 50, 27-56, 2014 | 41 | 2014 |
| 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: Proceedings of the …, 2001 | 41 | 2001 |
| 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 | 40 | 2007 |
| A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes AG D’yachkov, AJ Macula, WK Pogozelski, TE Renz, VV Rykov, ... DNA Computing: 10th International Workshop on DNA Computing, DNA10, Milan …, 2005 | 31 | 2005 |
| Upper bounds on the rate of superimposed (s, l)-codes based on engel’s inequality A D’yachkov, PA Vilenkin, S Yekhanin Proceedings of the International Conf. on Algebraic and Combinatorial Coding …, 2002 | 30 | 2002 |
| 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 | 29 | 2000 |
Anthony MaculaSUNY GeneseoVerified email at geneseo.edu
