### 摘要

The answer is "no." For gate-level circuits and single stuck-at faults, it has been shown that all m/n-code TSC checkers can be successfully designed, except one for 1/3 code. Although many researchers believe such a checker does not exist, none has proved that this is the case, which makes the problem open. In this paper, we show that no such checker exists using only AND, OR, and NOT gates (and, therefore, NAND and NOR gates). We solve this problem by giving a strict and clear proof. We also can deduce from our proof that no such TSC checker exists for any code which has only three code words.

原文 | English |
---|---|

頁（從 - 到） | 681-695 |

頁數 | 15 |

期刊 | Journal of Information Science and Engineering |

卷 | 13 |

發行號 | 4 |

出版狀態 | Published - 1997 十二月 1 |

### All Science Journal Classification (ASJC) codes

- Software
- Human-Computer Interaction
- Hardware and Architecture
- Computational Theory and Mathematics
- Library and Information Sciences

## 指紋 深入研究「Does there exist a combinational TSC checker for 1/3 code using only primitive gates?」主題。共同形成了獨特的指紋。

## 引用此

Chang, W. F., & Wu, C. W. (1997). Does there exist a combinational TSC checker for 1/3 code using only primitive gates?

*Journal of Information Science and Engineering*,*13*(4), 681-695.