Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm

Symmetry Pub Date : 2024-09-06 DOI:10.3390/sym16091169
Alhanouf Ali Alhomaidhi, Sami Alabiad, Nawal A. Alsarori
{"title":"Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm","authors":"Alhanouf Ali Alhomaidhi, Sami Alabiad, Nawal A. Alsarori","doi":"10.3390/sym16091169","DOIUrl":null,"url":null,"abstract":"Let u,v, and w be indeterminates over Fpm and let R=Fpm+uFpm+vFpm+wFpm, where p is a prime. Then, R is a ring of order p4m, and R≅Fpm[u,v,w]I with maximal ideal J=uFpm+vFpm+wFpm of order p3m and a residue field Fpm of order pm, where I is an appropriate ideal. In this article, the goal is to improve the understanding of linear codes over local non-chain rings. In particular, we investigate the symmetrized weight enumerators and generator matrices of linear codes of length N over R. In order to accomplish that, we first list all such rings up to the isomorphism for different values of the index of nilpotency l of J, 2≤l≤4. Furthermore, we fully describe the lattice of ideals of R and their orders. Next, for linear codes C over R, we compute the generator matrices and symmetrized weight enumerators, as shown by numerical examples.","PeriodicalId":501198,"journal":{"name":"Symmetry","volume":"9 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symmetry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/sym16091169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Let u,v, and w be indeterminates over Fpm and let R=Fpm+uFpm+vFpm+wFpm, where p is a prime. Then, R is a ring of order p4m, and R≅Fpm[u,v,w]I with maximal ideal J=uFpm+vFpm+wFpm of order p3m and a residue field Fpm of order pm, where I is an appropriate ideal. In this article, the goal is to improve the understanding of linear codes over local non-chain rings. In particular, we investigate the symmetrized weight enumerators and generator matrices of linear codes of length N over R. In order to accomplish that, we first list all such rings up to the isomorphism for different values of the index of nilpotency l of J, 2≤l≤4. Furthermore, we fully describe the lattice of ideals of R and their orders. Next, for linear codes C over R, we compute the generator matrices and symmetrized weight enumerators, as shown by numerical examples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fpm + uFpm + vFpm + wFpm 上线性编码的生成矩阵和对称权值枚举器
设 u、v、w 是 Fpm 上的不定项,设 R=Fpm+uFpm+vFpm+wFpm ,其中 p 是素数。那么,R 是阶 p4m 的环,R≅Fpm[u,v,w]I 具有阶 p3m 的最大理想 J=uFpm+vFpm+wFpm 和阶 pm 的残差域 Fpm,其中 I 是一个适当的理想。本文旨在加深对局部非链环上线性编码的理解。为了实现这一目标,我们首先列出了在 J 的无幂指数 l 的不同值(2≤l≤4)下直到同构的所有此类环。此外,我们还完整地描述了 R 的理想晶格及其阶数。接下来,对于 R 上的线性编码 C,我们计算了生成矩阵和对称权枚举器,并通过数值示例进行了说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Three-Dimensional Moran Walk with Resets The Optimization of Aviation Technologies and Design Strategies for a Carbon-Neutral Future A Channel-Sensing-Based Multipath Multihop Cooperative Transmission Mechanism for UE Aggregation in Asymmetric IoE Scenarios A New Multimodal Modification of the Skew Family of Distributions: Properties and Applications to Medical and Environmental Data Balance Controller Design for Inverted Pendulum Considering Detail Reward Function and Two-Phase Learning Protocol
×
引用
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