长度为n的所有不可约循环码的权枚举数

Pankaj Kumar
{"title":"长度为n的所有不可约循环码的权枚举数","authors":"Pankaj Kumar","doi":"10.1142/s1793830922501798","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text], where [Formula: see text] are distinct odd primes, be an integer and [Formula: see text] be a finite field of order [Formula: see text] with [Formula: see text]. We determine the weight enumerators of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] when multiplicative order of [Formula: see text] modulo [Formula: see text] is [Formula: see text]; [Formula: see text] and [Formula: see text]; [Formula: see text], where [Formula: see text].","PeriodicalId":342835,"journal":{"name":"Discret. Math. Algorithms Appl.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Weight enumerators of all irreducible cyclic codes of length n\",\"authors\":\"Pankaj Kumar\",\"doi\":\"10.1142/s1793830922501798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text], where [Formula: see text] are distinct odd primes, be an integer and [Formula: see text] be a finite field of order [Formula: see text] with [Formula: see text]. We determine the weight enumerators of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] when multiplicative order of [Formula: see text] modulo [Formula: see text] is [Formula: see text]; [Formula: see text] and [Formula: see text]; [Formula: see text], where [Formula: see text].\",\"PeriodicalId\":342835,\"journal\":{\"name\":\"Discret. Math. Algorithms Appl.\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Math. Algorithms Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830922501798\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Algorithms Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830922501798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

设[公式:见文]是一个整数,其中[公式:见文]是不同的奇数素数,[公式:见文]是一个有[公式:见文]的有序有限域[公式:见文]。当[公式:见文]模[公式:见文]的乘阶为[公式:见文]时,确定长度为[公式:见文]/[公式:见文]的所有不可约循环码的权枚举数;[公式:见文]和[公式:见文];[公式:见正文],而[公式:见正文]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Weight enumerators of all irreducible cyclic codes of length n
Let [Formula: see text], where [Formula: see text] are distinct odd primes, be an integer and [Formula: see text] be a finite field of order [Formula: see text] with [Formula: see text]. We determine the weight enumerators of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] when multiplicative order of [Formula: see text] modulo [Formula: see text] is [Formula: see text]; [Formula: see text] and [Formula: see text]; [Formula: see text], where [Formula: see text].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Graph antimagic labeling: A survey A short note on hyperenergetic Cayley graphs Inverse fair domination in the join and corona of graphs Semigroup structures via IVI-octahedron sets "Riesel" and another numbers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1