SKIP navigation
Department of Mathematics
Site Name Here

Group Testing and its Application to Information Transmission and Neural Networks.


Vyacheslav Rykov


Research will be carried out into the Boolean model of group testing that is used for the analysis of optimal procedures that search for defective units (defects) in a large population and optimal non-adaptive methods for the search of mutually eclipsing defects. By the results of some quantity of group tests which are set by the design, i.e. an incidence matrix for the tests, it is necessary to eliminate all defects, i.e. it is required to make the decision on what elements of a population are defective units. The theory of static design screen experiments can be applied to multiple-access information transmission networks and to neural networks. The problem to find the information capacity of multiple-access and to neural networks will be considered.


  1. Study the theoretical aspects of the problem by using the references below. This will help her/him understand the research topic and serve as an introduction to the final, written, research report.
  2. Develop new algorithms for group testing.
  3. Write computer programs for design screen experiments and modeling multiple access information transmission systems.
  4. Run the programs and help the adviser in analyses of generated designs and information transmission systems.
  5. Put together her/his findings, written software, significant graphs, tables, and so on in the final research report to be presented at the MAM Symposium.

Other Requirements

The students interested in the project above are expected to have taken and passed with maximal grades or close MATH 1950(Calc I), MATH 1960(Calc II), MATH 4050 (Linear Algebra) and MATH 4740 (Introduction to Probability and Statistics). They should be familiar with computers and MAPLE. The student is also expected to meet with the adviser a couple of times a week, (or communicate actively by e-mail) for discussions, guidance, and progress reports during the preparation period of the project.


  1. D'yachkov A.G., Rykov V.V. On associative nets. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, July 1997, p. 215
  2. A.G.Dyachkov, A.J. Macula, Rykov, “New constructions of superimposed codes”. IEEE Trans. on Inform. Theory , vol.46, N.1, 2000, pp. 284-290.
  3. A.G.D'yachkov and V.V. Rykov, “Optimal superimposed codes and designs for Renyi's search model”. Journal of Statistical Planning and Inference , vol. 100, 2002, pp. 281-302.
  4. A.J.Macula, V.V Rykov, S.M.Yekhanin, “Trivial two-stage group testing for complexes using almost disjunct matrices, Discrete Applied Mathematics , 137, No.1, 97-107 2004.
  5. V.V. Rykov, A.G. Dyachkov " Superimposed Codes and Designs for Group Testing Models ", , IMA workshop "Group Testing Designs, Algorithms, and Applications to Biology", Workshop Proceeding ,University of Minnesota, February 13-17, 2012. Minneapolis, Minnesota 55455-0436, USA
  6. V. Rykov, A.D’yachkov, C.Deppe, V.Lebedev, "Superimposed Codes and Threshold Group Testing," Volume of the Springer LNCS (Lecture Notes in Computer Science) 2013.
  7. L.A.Bassalygo, V.V.Rykov V. “Multiple Access Hyper Chanel” Problems of Information Transmission, No. 4, 2013.
  8. D. Du and F.K.Hwang, “Combinatorial Group Testing and its Applications”. World Scientific, 1993.