期刊
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
卷 69, 期 1, 页码 549-564出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s12190-022-01755-6
关键词
Finite chain rings; Cyclic codes; MDR codes; Self-dual cyclic codes
This paper studies the construction of self-dual MDR cyclic codes over a finite chain ring and provides conditions for the codes to be self-dual and self-orthogonal. By utilizing torsion codes, self-dual MDR cyclic codes over the Galois ring with certain length and divisibility conditions are constructed.
Maximum distance with respect to rank codes, or MDR codes, are a family of optimal linear codes that meet a Singleton-like bound in terms of the length and rank of the codes. In this paper, we study the construction of self-dual MDR cyclic codes over a finite chain ring R. We present a new form for the generator polynomials of cyclic codes over R of length n with the condition that the length n and the characteristic of R are relatively prime. Consequently, sufficient and necessary conditions for cyclic codes over R to be self-dual and self-orthogonal are obtained. As a result, self-dual MDR cyclic codes over the Galois ring GR(p(t), m) with length n >= 2 dividing p(m) - 1 are constructed by using torsion codes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据