scientific article; zbMATH DE number 1498793

MaRDI QIDQ4500984zbMATH OpenFDO

Authors I. M. Boyarinov

Publication date 3 September 2000

zbMATH Keywords

double-bit error-correcting (DED) codeself-checking decodersingle-bit error-correcting (SEC) code

Mathematics Subject Classification ID

Decoding (94B35) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Self-checking decoding algorithm for Reed-Solomon codes
• Efficient totally self-checking checkers for a class of Borden codes
• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )
• A hyper optimal encoding scheme for self-checking circuits
• On Optimal and Achievable Fix-Free Codes
• Universal algorithm for synthesizing self-checking testers for constant- weight codes
• Low-cost modular totally self-checking checker design for m-out-of-n code
• On TSC checkers for m-out-of-n codes
• Fault-Tolerant Decoders for Cyclic Error-Correcting Codes

Cited in

(4)

• A Theory of Totally Self-Checking System Design
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Low-cost modular totally self-checking checker design for m-out-of-n code
• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500984)