RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Forthcoming seminars
Seminar calendar
List of seminars
Archive by years
Register a seminar

Search
RSS
Forthcoming seminars





You may need the following programs to see the files








Principle Seminar of the Department of Probability Theory, Moscow State University
March 22, 2017 16:45, Moscow, MSU, auditorium 12-24
 


Coding Theory at the Department of Probability Theory

N. A. Polyanskiiab

a Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
Materials:
Adobe PDF 699.2 Kb

Number of views:
This page:38
Materials:6

Abstract: Suppose that among a large set of factors there is a small subset of significant factors. The problem of screening experiments design is to find all significant factors by carrying out group tests on properly chosen subsets of the set of factors. The test outcome is positive if the testing group contains one or more significant elements; otherwise, it is negative. Our goal is to design the minimal number of such group tests.
The topic has been treated extensively. The analogies of Shannon's theorem were proved by Malyutov M. and Freidlina V. (1975). Some underlying results for a combinatorial model were established by D'yachkov A., Rykov V., and Vilenkin P. (1982, 1989, 2000, 2002). We discuss the subsequent development of the field. In particular, we focus on lower and upper bounds of asymptotic rates for designs (codes) arising naturally for solving problems in the given area.
The present talk is based on the joint work with D'yachkov A., Vorobyev I., and Shchukin V.

Materials: talk_22032017.pdf (699.2 Kb)

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017