Irreducible cyclic ℤ4—codes and allied sequences

A. Alahmadi, T. Helleseth, N. Muthana, Atiqah Almuzaini, P. Solé
{"title":"Irreducible cyclic ℤ4—codes and allied sequences","authors":"A. Alahmadi, T. Helleseth, N. Muthana, Atiqah Almuzaini, P. Solé","doi":"10.1109/IWSDA.2015.7458395","DOIUrl":null,"url":null,"abstract":"With every odd integer N, is attached an infinite family of irreducible cyclic ℤ<sub>4</sub>-codes, of lengths of the form n = 2<sup>m</sup>- 1/N over N, for some m ≤ 3. The correlation performance of the related quaternary sequences is studied by means of incomplete Gauss sums over Galois rings.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2015.7458395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With every odd integer N, is attached an infinite family of irreducible cyclic ℤ4-codes, of lengths of the form n = 2m- 1/N over N, for some m ≤ 3. The correlation performance of the related quaternary sequences is studied by means of incomplete Gauss sums over Galois rings.
不可约循环l4码及其相关序列
对于每一个奇数N,有一个不可约循环的无穷族,其长度形式为N = 2m- 1/N /N,对于m≤3。利用伽罗瓦环上的不完全高斯和研究了相关四元序列的相关性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信