亨塞尔码到有理数的转换

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1900-01-01 DOI:10.1109/ARITH.1981.6159290

T. Rao, R. T. Gregory

{"title":"亨塞尔码到有理数的转换","authors":"T. Rao, R. T. Gregory","doi":"10.1109/ARITH.1981.6159290","DOIUrl":null,"url":null,"abstract":"In a finite-segment p-adic number system one of the difficult problems is concerned with converting Hensel codes back into rational numbers. An algorithm for this conversion is proposed which is based on a sophisticated table look-up procedure.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"The conversion of Hensel codes to rational numbers\",\"authors\":\"T. Rao, R. T. Gregory\",\"doi\":\"10.1109/ARITH.1981.6159290\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a finite-segment p-adic number system one of the difficult problems is concerned with converting Hensel codes back into rational numbers. An algorithm for this conversion is proposed which is based on a sophisticated table look-up procedure.\",\"PeriodicalId\":169426,\"journal\":{\"name\":\"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1981.6159290\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1981.6159290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

在有限段p进数系统中，如何将亨塞尔码转换回有理数是一个难题。提出了一种基于复杂的表查找过程的转换算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The conversion of Hensel codes to rational numbers

In a finite-segment p-adic number system one of the difficult problems is concerned with converting Hensel codes back into rational numbers. An algorithm for this conversion is proposed which is based on a sophisticated table look-up procedure.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)

自引率

0.00%

发文量