Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2019, Volume 31, Issue 2, Pages 14–19
DOI: https://doi.org/10.4213/dm1557 (Mi dm1557) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs

Yu. V. Borodinaab

a Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Moscow
b Bauman Moscow State Technical University
Full-text PDF (358 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1557
Abstract: We consider Boolean circuits in Zhegalkin basis and describe all Boolean functions that can be implemented by a circuit admitting a complete fault detection test of length $1$ in case of constant faults of type “1” at gate outputs.
Keywords: Boolean circuits, constant faults, fault detection tests, Zhegalkin basis.
Funding agency Grant number
Russian Academy of Sciences - Federal Agency for Scientific Organizations PRAS-18-01
Received: 26.12.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 5, Pages 303–306
DOI: https://doi.org/10.1515/dma-2020-0026
Bibliographic databases:
Document Type: Article
UDC: 519.718.7
Language: Russian
Citation: Yu. V. Borodina, “Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs”, Diskr. Mat., 31:2 (2019), 14–19; Discrete Math. Appl., 30:5 (2020), 303–306
Citation in format AMSBIB
\Bibitem{Bor19}
\by Yu.~V.~Borodina
\paper Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1'' at gate outputs
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 2
\pages 14--19
\mathnet{http://mi.mathnet.ru/dm1557}
\crossref{https://doi.org/10.4213/dm1557}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3962497}
\elib{https://elibrary.ru/item.asp?id=37652125}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 5
\pages 303--306
\crossref{https://doi.org/10.1515/dma-2020-0026}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000582465000002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85094891458}
Linking options:
  • https://www.mathnet.ru/eng/dm1557
  • https://doi.org/10.4213/dm1557
  • https://www.mathnet.ru/eng/dm/v31/i2/p14
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:328
    Full-text PDF :32
    References:32
    First page:15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024