Loading [MathJax]/jax/output/CommonHTML/jax.js
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, 1982, Volume 18, Issue 2, Pages 74–82 (Mi ppi1227)  
This article is cited in 7 scientific papers (total in 7 papers)

Automata Theory and Pattern Recognition

Completely Separating Systems

Yu. L. Sagalovich
Full-text PDF (1036 kB) Citations (7)
Abstract: The author introduces a definition of binary codes that are redundant completely separating systems, with the aim of employing them for antirace and simultaneously noise-stable state assignment for asynchronous discrete automata. The limits of the parameters of these codes are determined. Concatenated codes with the above properties are constructed on the basis of Reed–Solomon codes. It is shown that the requirement of noise stability does not conflict with the property of monotonicity of the logical functions of the combination unit of the automaton, which obtains upon state assignment by completely separating systems that are not redundant.
Received: 20.04.1981
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:62-507
Language: Russian
Citation: Yu. L. Sagalovich, “Completely Separating Systems”, Probl. Peredachi Inf., 18:2 (1982), 74–82; Problems Inform. Transmission, 18:2 (1982), 140–146
Citation in format AMSBIB
\Bibitem{Sag82}
\by Yu.~L.~Sagalovich
\paper Completely Separating Systems
\jour Probl. Peredachi Inf.
\yr 1982
\vol 18
\issue 2
\pages 74--82
\mathnet{http://mi.mathnet.ru/ppi1227}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=689341}
\zmath{https://zbmath.org/?q=an:0499.94031}
\transl
\jour Problems Inform. Transmission
\yr 1982
\vol 18
\issue 2
\pages 140--146
Linking options:
  • https://www.mathnet.ru/eng/ppi1227
  • https://www.mathnet.ru/eng/ppi/v18/i2/p74
    • This publication is cited in the following 7 articles:
    1. I. V. Vorob'ev, V. S. Lebedev, “Improved upper bounds for the rate of separating and completely separating codes”, Problems Inform. Transmission, 58:3 (2022), 242–253  mathnet  crossref  crossref
    2. D'yachkov A. Polyanskii N. Shchukin V. Vorobyev I., “Separable Codes For the Symmetric Multiple-Access Channel”, IEEE Trans. Inf. Theory, 65:6 (2019), 3738–3750  crossref  mathscinet  zmath  isi  scopus
    3. I. V. Vorob'ev, “Bounds on the rate of separating codes”, Problems Inform. Transmission, 53:1 (2017), 30–41  mathnet  crossref  isi  elib
    4. D'yachkov A.G. Vorobyev I.V. Polyanskii N.A. Shchukin V.Yu., “Cover-Free Codes and Separating System Codes”, Designs Codes Cryptogr., 82:1-2, SI (2017), 197–209  crossref  isi
    5. V. S. Lebedev, “Separating codes and a new combinatorial search model”, Problems Inform. Transmission, 46:1 (2010), 1–6  mathnet  crossref  mathscinet  isi
    6. V. M. Sidel'nikov, O. Yu. Prikhodov, “On the construction of (w,r) cover-free codes”, Problems Inform. Transmission, 45:1 (2009), 32–36  mathnet  crossref  mathscinet  zmath  isi
    7. V. S. Lebedev, “Asymptotic Upper Bound for the Rate of (w,r) Cover-Free Codes”, Problems Inform. Transmission, 39:4 (2003), 317–323  mathnet  crossref  mathscinet  zmath
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:378
    Full-text PDF :171
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025