Asymptotically good generalized quasi-cyclic codes over finite chain rings

ADVANCES IN MATHEMATICS OF COMMUNICATIONS(2023)

引用 0|浏览0
暂无评分
摘要
In this paper, we construct a class of generalized quasi-cyclic (GQC) codes with index P over finite chain rings. Based on probabilistic arguments, we discuss asymptotic rates and relative distances of this class of codes. As a result, we show that GQC codes with index P over finite chain rings are asymptotically good.
更多
查看译文
关键词
finite chain rings,quasi-cyclic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要