RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2010, Volume 46, Issue 1, Pages 3–8 (Mi ppi2005)  

This article is cited in 5 scientific papers (total in 5 papers)

Coding Theory

Separating codes and a new combinatorial search model

V. S. Lebedev

A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: We propose a new group testing model, which is related to separating codes and cover-free codes.

Full text: PDF file (197 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2010, 46:1, 1–6

Bibliographic databases:

UDC: 621.391.15
Received: 07.07.2009
Revised: 18.11.2009

Citation: V. S. Lebedev, “Separating codes and a new combinatorial search model”, Probl. Peredachi Inf., 46:1 (2010), 3–8; Problems Inform. Transmission, 46:1 (2010), 1–6

Citation in format AMSBIB
\Bibitem{Leb10}
\by V.~S.~Lebedev
\paper Separating codes and a~new combinatorial search model
\jour Probl. Peredachi Inf.
\yr 2010
\vol 46
\issue 1
\pages 3--8
\mathnet{http://mi.mathnet.ru/ppi2005}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2675294}
\transl
\jour Problems Inform. Transmission
\yr 2010
\vol 46
\issue 1
\pages 1--6
\crossref{https://doi.org/10.1134/S0032946010010011}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000276978000001}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77951527942}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2005
  • http://mi.mathnet.ru/eng/ppi/v46/i1/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Ahlswede R., Deppe Ch., Lebedev V., “Bounds for threshold and majority group testing”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), 2011, 69–73  crossref  mathscinet  isi  scopus
    2. Ahlswede R., Deppe Ch., Lebedev V., “Majority group testing with density tests”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), 2011, 326–330  crossref  isi  scopus
    3. R. Ahlswede, C. Deppe, V. S. Lebedev, “Finding one of $D$ defective elements in some group testing models”, Problems Inform. Transmission, 48:2 (2012), 173–181  mathnet  crossref  isi
    4. C. Deppe, V. S. Lebedev, “Group testing problem with two defectives”, Problems Inform. Transmission, 49:4 (2013), 375–381  mathnet  crossref  isi
    5. Laarhoven T., “Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities”, IEEE Trans. Inf. Forensic Secur., 10:9 (2015), 1967–1980  crossref  isi  elib  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:458
    Full text:123
    References:54
    First page:16

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020