Totally Self-Checking Checkers for Low-Cost Arithmetic Codes

DOI10.1109/TC.1985.1676598MaRDI QIDQ3682393zbMATH OpenFDO

Authors Nicolas Gaitanis

Publication date 1985

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

Full work available at URL https://doi.org/10.1109/TC.1985.1676598

zbMATH Keywords

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

Mathematics Subject Classification ID

Arithmetic codes (94B40)

Recommendations

• Low-cost modular totally self-checking checker design for m-out-of-n code
• Efficient totally self-checking checkers for a class of Borden codes
• scientific article; zbMATH DE number 1498793
• Synthesis of self-checking checkers for codes with addition
• A hyper optimal encoding scheme for self-checking circuits
• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )
• Universal algorithm for synthesizing self-checking testers for constant- weight codes
• Design of self-checking checkers for 1-out-of-3 codes
• Self-checking decoding algorithm for Reed-Solomon codes

Cited in

(7)

• Techniques for efficiently implementing totally self-checking checkers in MOS technology
• PLA Implementation of k-out-of-n Code TSC Checker
• Design of self-testing checkers for Borden codes
• Efficient totally self-checking checkers for a class of Borden codes
• On TSC checkers for m-out-of-n codes
• scientific article; zbMATH DE number 1498793 (Why is no real title available?)
• Low-cost modular totally self-checking checker design for m-out-of-n code

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)