On Linear Codes over Finite Singleton Local Rings

Author:

Alabiad Sami1ORCID,Alhomaidhi Alhanouf Ali1ORCID,Alsarori Nawal A.2ORCID

Affiliation:

1. Department of Mathematics, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia

2. Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad 431004, India

Abstract

The study of linear codes over local rings, particularly non-chain rings, imposes difficulties that differ from those encountered in codes over chain rings, and this stems from the fact that local non-chain rings are not principal ideal rings. In this paper, we present and successfully establish a new approach for linear codes of any finite length over local rings that are not necessarily chains. The main focus of this study is to produce generating characters, MacWilliams identities and generator matrices for codes over singleton local Frobenius rings of order 32. To do so, we first start by characterizing all singleton local rings of order 32 up to isomorphism. These rings happen to have strong connections to linear binary codes and Z4 codes, which play a significant role in coding theory.

Funder

King Saud University, Riyadh, Saudi Arabia

Publisher

MDPI AG

Reference19 articles.

1. Duality for modules over finite rings and applications to coding theory;Wood;Am. J. Math.,1999

2. Alkhamees, Y., and Alabiad, S. (2022). The structure of local rings with singleton basis and their enumeration. Mathematics, 10.

3. Finite associative rings;Raghavendran;Compos. Math.,1969

4. Characterization of finite Frobenius rings;Honold;Arch. Math.,2001

5. Linear codes over ℤ4[x]/(x2 + 2x);Szabo;Int. Inf. Coding Theory,2015

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3