{"title":"二元函数的调和分析","authors":"J. Belfiore, Y. Hong, E. Viterbo","doi":"10.1109/ITW.2015.7133147","DOIUrl":null,"url":null,"abstract":"In this paper we introduce the two-modular Fourier transform of a binary function f : R → R defined over a finite commutative ring R = F2[X]/φ(X), where F2[X] is the ring of polynomials with binary coefficients and φ(X) is a polynomial of degree n, which is not a multiple of X. We also introduce the corresponding inverse Fourier transform. We then prove the corresponding convolution theorem.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Harmonic analysis of binary functions\",\"authors\":\"J. Belfiore, Y. Hong, E. Viterbo\",\"doi\":\"10.1109/ITW.2015.7133147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce the two-modular Fourier transform of a binary function f : R → R defined over a finite commutative ring R = F2[X]/φ(X), where F2[X] is the ring of polynomials with binary coefficients and φ(X) is a polynomial of degree n, which is not a multiple of X. We also introduce the corresponding inverse Fourier transform. We then prove the corresponding convolution theorem.\",\"PeriodicalId\":174797,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop (ITW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2015.7133147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we introduce the two-modular Fourier transform of a binary function f : R → R defined over a finite commutative ring R = F2[X]/φ(X), where F2[X] is the ring of polynomials with binary coefficients and φ(X) is a polynomial of degree n, which is not a multiple of X. We also introduce the corresponding inverse Fourier transform. We then prove the corresponding convolution theorem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
