有限域的算法

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH) Pub Date : 1981-05-16 DOI:10.1109/ARITH.1981.6159289

T. Rao

{"title":"有限域的算法","authors":"T. Rao","doi":"10.1109/ARITH.1981.6159289","DOIUrl":null,"url":null,"abstract":"The arithmetic operations in finite fields and their implementation are important to the construction of error detecting and correcting codes. The addition, multiplication and division in the field GF(2m) are implemented as polynomial operations using binary logic of flip-flops and EXOR's. For fields of non-binary characteristic, modular arithmetic (with modulus p, a prime) becomes important. This paper focuses on problems relating to the arithmetic of GF(p), and some recent results and new ideas on this topic are presented here.","PeriodicalId":169426,"journal":{"name":"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Arithmetic of finite fields\",\"authors\":\"T. Rao\",\"doi\":\"10.1109/ARITH.1981.6159289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The arithmetic operations in finite fields and their implementation are important to the construction of error detecting and correcting codes. The addition, multiplication and division in the field GF(2m) are implemented as polynomial operations using binary logic of flip-flops and EXOR's. For fields of non-binary characteristic, modular arithmetic (with modulus p, a prime) becomes important. This paper focuses on problems relating to the arithmetic of GF(p), and some recent results and new ideas on this topic are presented here.\",\"PeriodicalId\":169426,\"journal\":{\"name\":\"1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.6159289\",\"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.6159289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

有限域内的算术运算及其实现对纠错码的构造具有重要意义。字段GF(2m)中的加法、乘法和除法使用触发器和EXOR的二进制逻辑作为多项式运算实现。对于非二进制特征域，模运算(模数为p，素数)变得很重要。本文主要讨论了GF(p)的算法问题，并给出了一些最新的结果和一些新的思想。

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

查看原文本刊更多论文

Arithmetic of finite fields

The arithmetic operations in finite fields and their implementation are important to the construction of error detecting and correcting codes. The addition, multiplication and division in the field GF(2m) are implemented as polynomial operations using binary logic of flip-flops and EXOR's. For fields of non-binary characteristic, modular arithmetic (with modulus p, a prime) becomes important. This paper focuses on problems relating to the arithmetic of GF(p), and some recent results and new ideas on this topic are presented here.

求助全文

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

来源期刊

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH)

自引率

0.00%

发文量