A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers

DOI10.1007/BF02523188zbMath0812.94021MaRDI QIDQ1341142

Hari Krishna

Publication date: 2 January 1995

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

decoderalgorithmsring of integersfault-tolerant computingencoder

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Parallel algorithms in computer science (68W10) Decoding (94B35) Arithmetic codes (94B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm-Based Fault Tolerance for Matrix Operations
• A linear algebraic model of algorithm-based fault tolerance
• A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction
• A coding theory approach to error control in redundant residue number systems. II. Multiple error detection and correction
• Codes over integer residue rings
• Codes over Zm
• Codes over Zm, revisited
• Codes over certain rings
• Systems Of Linear Congruences

This page was built for publication: A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers