It has been stated by R.N. Gorgui-Naguib and R.A. King (1986) that the operations of addition and multiplication on Hensel codes originally defined by E.V. Krishnamurthy, T.M. Rao, and K. Subramanian (1975) are seriously in error in that it is possible to add/subtract or multiply Hensel codes and not get a valid Hensel code. It is shown that it is the presence of so-called invalid Farey fractions that results in the need to modify the original arithmetic operations. However, this also results in the Hensel codes becoming redundant. The authors show how to include the invalid Farey fractions such that it is possible to compute with their Hensel codings without the need to map back and forth between the rationals and their Hensel codings. This provides an alternative to the method of Gorgui-Naguib and King. Unfortunately, it turns out that Hensel codes of a large size will be needed in practice, even for relatively small problems. >
[1]
E. V. Krishnamurthy,et al.
Methods and Applications of Error-Free Computation
,
1984,
Texts and Monographs in Computer Science.
[2]
Raouf N. Gorgui-Naguib,et al.
Comments on "Matrix Processors Using p-Adic Arithmetic for Exact Linear Computations"
,
1986,
IEEE Trans. Computers.
[3]
N. Koblitz.
p-adic Numbers, p-adic Analysis, and Zeta-Functions
,
1977
.
[4]
E. V. Krishnamurthy,et al.
Matrix Processors Using p-adic Arithmetic for Exact Linear Computations
,
1977,
IEEE Transactions on Computers.
[5]
E. V. Krishnamurthy,et al.
p-Adic arithmetic procedures for exact matrix computations
,
1975
.