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
September 21, 2016 17:15, Moscow, MSU, auditorium 12-24
 


Disjunctive List-Decoding Codes

V. Yu. Shchukin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Number of views:
This page:34

Abstract: A binary code of size $t$ and length $N$ is said to be a disjunctive list-decoding code (LD-code) of strength $s$ with list size $L$, $s+L < t$, if it is an incidence matrix of a family of $t$ subsets of $N$-set where the union of any $s$ sets does not contain the union of any other $L$ sets of this family. The purpose of this work is to develop probabilistic and combinatorial methods for obtaining new lower and upper asymptotic bounds on the maximal size $t(s,L,N)$ of LD-codes and their generalizations called LD-hypercodes. Such codes are considered in the problems of nonadaptive group testing, transmitting messages through a multiple access channel, fingerprinting digital data and some other applications of information theory and coding theory.

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