Totally Self-Checking Checkers for Low-Cost Arithmetic Codes

DOI10.1109/TC.1985.1676598zbMATH Open0566.94013MaRDI QIDQ3682393

Nicolas Gaitanis

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

inverse residue codeslow-cost AN codeslow-cost codesTSC residue generator

Mathematics Subject Classification ID

Arithmetic codes (94B40)

Related Items (3)

Low-cost modular totally self-checking checker design for m-out-of-n code ⋮ Title not available (Why is that?) ⋮ Design of self-testing checkers for Borden codes

Recommendations

• Title not available (Why is that?) 👍 👎
• Universal algorithm for synthesizing self-checking testers for constant- weight codes 👍 👎
• Synthesis of self-checking checkers for codes with addition 👍 👎
• Design of self-checking checkers for 1-out-of-3 codes 👍 👎
• A hyper optimal encoding scheme for self-checking circuits 👍 👎
• Efficient totally self-checking checkers for a class of Borden codes 👍 👎
• Low-cost modular totally self-checking checker design for m-out-of-n code 👍 👎
• Self-checking decoding algorithm for Reed-Solomon codes 👍 👎
• 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: Totally Self-Checking Checkers for Low-Cost Arithmetic Codes

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