Universal algorithm for synthesizing self-checking testers for constant- weight codes
From MaRDI portal
Recommendations
- Techniques for efficiently implementing totally self-checking checkers in MOS technology
- Synthesis of self-checking combination devices based on allocating special groups of outputs
- Design of self-checking checkers for 1-out-of-3 codes
- Design of maximum-speed self-checking m-out-of-n checkers
- An efficient technique for obtaining unate implementation of functions through input encoding
- scientific article; zbMATH DE number 4123679
- Design of Fast Self-Testing Checkers for a Class of Berger Codes
- Design methods of single-output built-in self-checking circuits for equilibrium codes
Cited in
(9)- Design of self-testing checkers for Borden codes
- Synthesis of self-checking checkers for codes with addition
- Design of maximum-speed self-checking m-out-of-n checkers
- Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
- A hyper optimal encoding scheme for self-checking circuits
- scientific article; zbMATH DE number 1498793 (Why is no real title available?)
- scientific article; zbMATH DE number 4123679 (Why is no real title available?)
- Universal synthesis algorithm for 1/n testers
- Design methods of single-output built-in self-checking circuits for equilibrium codes
This page was built for publication: Universal algorithm for synthesizing self-checking testers for constant- weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080840)
