当前位置：
X-MOL 学术
›
Finite Fields Their Appl.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A bound on the minimum distance of generalized quasi-twisted codes
Finite Fields and Their Applications ( IF 1 ) Pub Date : 2020-07-13 , DOI: 10.1016/j.ffa.2020.101712 Xiaotong Hou , Jian Gao
更新日期：2020-07-13
Finite Fields and Their Applications ( IF 1 ) Pub Date : 2020-07-13 , DOI: 10.1016/j.ffa.2020.101712 Xiaotong Hou , Jian Gao
Generalized quasi-twisted (GQT) codes form a generalization of quasi-twisted (QT) codes and generalized quasi-cyclic (GQC) codes. By the Chinese remainder theorem, the GQT codes can be decomposed into a direct sum of some linear codes over Galois extension fields, which leads to the trace representation of the GQT codes. Using this trace representation, we first prove the minimum distance bound for GQT codes with two constituents. Then we generalize the result to GQT codes with s constituents. Finally, we present some examples to show that the bound is better than the well-known Esmaeili-Yari bound and sharp in many instances.
京公网安备 11010802027423号