Asymptotically good LCD 2-quasi-abelian codes over finite fields

IF 0.7 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2024-08-29 DOI:10.1016/j.disc.2024.114224
Guanghui Zhang , Liren Lin , Xuemei Liu
{"title":"Asymptotically good LCD 2-quasi-abelian codes over finite fields","authors":"Guanghui Zhang ,&nbsp;Liren Lin ,&nbsp;Xuemei Liu","doi":"10.1016/j.disc.2024.114224","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we construct a class of linear complementary dual (LCD for short) 2-quasi-abelian codes over a finite field. Based on counting the number of such codes and estimating the number of the codes in this class whose relative minimum weights are small, we prove that the class of LCD 2-quasi-abelian codes over any finite field is asymptotically good. The existence of such codes is unconditional, which is different from the case of self-dual 2-quasi-abelian codes over a special finite field.</p></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 1","pages":"Article 114224"},"PeriodicalIF":0.7000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0012365X24003558/pdfft?md5=d75cfe8788325d2bba4c277d4bfdd968&pid=1-s2.0-S0012365X24003558-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24003558","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we construct a class of linear complementary dual (LCD for short) 2-quasi-abelian codes over a finite field. Based on counting the number of such codes and estimating the number of the codes in this class whose relative minimum weights are small, we prove that the class of LCD 2-quasi-abelian codes over any finite field is asymptotically good. The existence of such codes is unconditional, which is different from the case of self-dual 2-quasi-abelian codes over a special finite field.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有限域上渐近良好的 LCD 2-类阿贝尔码
在本文中,我们构建了一类有限域上的线性互补对偶(简称 LCD)2-类阿贝尔码。基于对这类编码数量的统计和对该类编码中相对最小权值较小的编码数量的估计,我们证明了任意有限域上的 LCD 2-quasi-abelian 编码类是渐近良好的。这类码的存在是无条件的,这与特殊有限域上的自偶 2- 类阿贝尔码的情况不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Spectral upper bounds for the Grundy number of a graph Transitive (q − 1)-fold packings of PGn(q) Truncated theta series related to the Jacobi Triple Product identity Explicit enumeration formulas for m-regular simple stacks The e−positivity of some new classes of graphs
×
引用
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