Polynomial expansions over GF(3) based on fastest transformation

B. Falkowski, Cheng Fu
{"title":"Polynomial expansions over GF(3) based on fastest transformation","authors":"B. Falkowski, Cheng Fu","doi":"10.1109/ISMVL.2003.1201382","DOIUrl":null,"url":null,"abstract":"A new fastest Linearly Independent (LI) transforms over GF(3) and its corresponding polynomial expansions have been introduced. The number of required additions and multiplications in new LI transform is advantageous when compared with ternary Reed-Muller transform, which was previously known as the most efficient transform over GF(3). This paper discusses various properties of these fastest LI transforms and their corresponding polynomial expansions over GF(3) as well as their comparison with ternary Reed-Muller transform and its implementation in hardware.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2003.1201382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

A new fastest Linearly Independent (LI) transforms over GF(3) and its corresponding polynomial expansions have been introduced. The number of required additions and multiplications in new LI transform is advantageous when compared with ternary Reed-Muller transform, which was previously known as the most efficient transform over GF(3). This paper discusses various properties of these fastest LI transforms and their corresponding polynomial expansions over GF(3) as well as their comparison with ternary Reed-Muller transform and its implementation in hardware.
基于最快变换的GF(3)上的多项式展开式
介绍了GF(3)上一种新的最快的线性无关变换及其相应的多项式展开式。与以前被称为GF(3)上最有效的三元Reed-Muller变换相比,新的LI变换所需的加法和乘法的数量是有利的。本文讨论了这些最快LI变换的各种性质及其在GF(3)上对应的多项式展开式,以及它们与三元Reed-Muller变换的比较及其在硬件上的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信