Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Problemy Peredachi Informatsii, 2022, Volume 58, Issue 3, Pages 45–57
DOI: https://doi.org/10.31857/S0555292322030044 (Mi ppi2374) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Coding Theory

Improved upper bounds for the rate of separating and completely separating codes

I. V. Vorob'eva, V. S. Lebedevb

a Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
b Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (217 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0555292322030044
Abstract: A binary code is said to be an $(s,\ell)$-separating code if for any two disjoint sets of its codewords of cardinalities at most s and respectively, there exists a coordinate in which all words of the first set have symbol $0$ while all words of the second have $1$. If, moreover, for any two sets there exists a second coordinate in which all words of the first set have $1$ and all words of the second have $0$, then such a code is called an $(s,\ell)$-completely separating code. We improve upper bounds on the rate of separating and completely separating codes.
Keywords: separating codes, completely separating codes, asymptotic rate, Plotkin bound.
Funding agency Grant number
Russian Science Foundation 22-41-02028
Russian Foundation for Basic Research 20-51-18002
The research of I.V.Vorob’ev was carried out at the expense of the Russian Science Foundation, project no. 22-41-02028. The research of V.S. Lebedev was supported in part by the joint grant of the Russian Foundation for Basic Research and the Bulgarian National Science Fund, project no. 20-51-18002.
Received: 14.04.2022
Revised: 28.07.2022
Accepted: 30.07.2022
English version:
Problems of Information Transmission, 2022, Volume 58, Issue 3, Pages 242–253
DOI: https://doi.org/10.1134/S0032946022030048
Bibliographic databases:
Document Type: Article
UDC: 621.391 : 519.72
Language: Russian
Citation: I. V. Vorob'ev, V. S. Lebedev, “Improved upper bounds for the rate of separating and completely separating codes”, Probl. Peredachi Inf., 58:3 (2022), 45–57; Problems Inform. Transmission, 58:3 (2022), 242–253
Citation in format AMSBIB
\Bibitem{VorLeb22}
\by I.~V.~Vorob'ev, V.~S.~Lebedev
\paper Improved upper bounds for the rate of separating and completely separating codes
\jour Probl. Peredachi Inf.
\yr 2022
\vol 58
\issue 3
\pages 45--57
\mathnet{http://mi.mathnet.ru/ppi2374}
\edn{https://elibrary.ru/EADNOC}
\transl
\jour Problems Inform. Transmission
\yr 2022
\vol 58
\issue 3
\pages 242--253
\crossref{https://doi.org/10.1134/S0032946022030048}
Linking options:
  • https://www.mathnet.ru/eng/ppi2374
  • https://www.mathnet.ru/eng/ppi/v58/i3/p45
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025