Binary Logic for Residue Arithmetic Using Magnitude Index

DOI10.1109/T-C.1970.223026zbMath0199.51701MaRDI QIDQ5597995

No author found.

Publication date: 1970

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

zbMATH Keywords

computer science and automata

Related Items (5)

Arithmetic codes resembling neural encoding ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications ⋮ Error codes in residue number systems with magnitude index ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

This page was built for publication: Binary Logic for Residue Arithmetic Using Magnitude Index