2010
DOI: 10.1134/s0005117910060123
|View full text |Cite
|
Sign up to set email alerts
|

On summation code properties in functional control circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 39 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…5. Any SM(m,k)-code does not detect the same fraction of errors of d multiplicity in code data vectors of the total number of errors of this multiplicity if d<M. 6. The value of d factor approaches the value d for Berger code with increasing of M value for any SM(m,k)-codes [6]:…”
Section: Modular Sum Codes Characteristics For Error Detection In Datmentioning
confidence: 97%
See 2 more Smart Citations
“…5. Any SM(m,k)-code does not detect the same fraction of errors of d multiplicity in code data vectors of the total number of errors of this multiplicity if d<M. 6. The value of d factor approaches the value d for Berger code with increasing of M value for any SM(m,k)-codes [6]:…”
Section: Modular Sum Codes Characteristics For Error Detection In Datmentioning
confidence: 97%
“…At the system design phase the operational functions of controlled unit are matched with the length of data vector, m, and the outputs of controlling unit -with the length of check vector, k. During the process of system operation the single faults of controlled unit can result in the distortions of bit values of data vector with different multiplicities d. The capability of system to detect the errors in controlled unit is also depend on (m,k)-code characteristics. Thus, it is possible to consider the characteristics of certain (m,k)-code based on the error detection in data vectors, studying by this the features of the discrete system itself [6].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…S(n, m)-codes have an important property [11]: for every Berger code, the fraction of undetectable errors in data bits of multiplicity d of the total number of errors in data bits of this multiplicity does not depend on the number of data bits and is a constant…”
Section: Codes With Data Bits Summation and Optimal Codesmentioning
confidence: 99%
“…Then we change the fault circuit for the fault free one. Besides that, we may apply fault tolerance circuits using self-checking circuits and checkers [1][2][3]. Unfortunately, these methods are connected with the essential structural overhead (exceeding 100%) often unacceptable in practice.…”
Section: Introductionmentioning
confidence: 99%