Binary Logic for Residue Arithmetic Using Magnitude Index
From MaRDI portal
Publication:5597995
DOI10.1109/T-C.1970.223026zbMATH Open0199.51701MaRDI QIDQ5597995FDOQ5597995
Authors:
Publication date: 1970
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Cited In (5)
- Error codes in residue number systems with magnitude index
- Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
- An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
- Arithmetic codes resembling neural encoding
This page was built for publication: Binary Logic for Residue Arithmetic Using Magnitude Index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597995)
