A class of linear codes of length 2 over finite chain rings

Author:

Cao Yonglin1,Cao Yuan12,Dinh Hai Q.34,Fu Fang-Wei5,Gao Jian1,Sriboonchitta Songsak6

Affiliation:

1. School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255091, P. R. China

2. School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, Hunan 410114, P. R. China

3. Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam

4. Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam

5. Chern Institute of Mathematics and LPMC, Nankai University, Tianjin 300071, P. R. China

6. Faculty of Economics, Chiang Mai University, Chiang Mai 52000, Thailand

Abstract

Let [Formula: see text] be a finite field of cardinality [Formula: see text], where [Formula: see text] is an odd prime, [Formula: see text] be positive integers satisfying [Formula: see text], and denote [Formula: see text], where [Formula: see text] is an irreducible polynomial in [Formula: see text]. In this note, for any fixed invertible element [Formula: see text], we present all distinct linear codes [Formula: see text] over [Formula: see text] of length [Formula: see text] satisfying the condition: [Formula: see text] for all [Formula: see text]. This conclusion can be used to determine the structure of [Formula: see text]-constacyclic codes over the finite chain ring [Formula: see text] of length [Formula: see text] for any positive integer [Formula: see text] satisfying [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Algebra and Number Theory

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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