|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 2, Pages 77–88
(Mi ppi339)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Automata Theory
Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials
Yu. L. Sagalovich
Abstract:
The vector of a lexicographically arranged Boolean elementary interval can belong to no cyclic code whose generator polynomial has roots distinct from unity. Therefore, under some additional conditions upon the scheme to be tested and the sequence of test actions, the cyclic code a priori detects all faulty schemes from a rather wide class. The conditions mentioned lead to the consideration of a new class of separating systems.
Received: 13.12.1994
Citation:
Yu. L. Sagalovich, “Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials”, Probl. Peredachi Inf., 32:2 (1996), 77–88; Problems Inform. Transmission, 32:2 (1996), 205–215
Linking options:
https://www.mathnet.ru/eng/ppi339 https://www.mathnet.ru/eng/ppi/v32/i2/p77
|
Statistics & downloads: |
Abstract page: | 178 | Full-text PDF : | 77 |
|