On the conversion of hensel codes to farey rationals

Krishnamurthy, E. V. (1983) On the conversion of hensel codes to farey rationals IEEE Transactions on Computers, C-32 (4). pp. 331-337. ISSN 0018-9340

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/TC.1983.1676233


Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space).

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
ID Code:28201
Deposited On:15 Dec 2010 12:25
Last Modified:04 Jun 2011 07:02

Repository Staff Only: item control page