The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
复制标题
DOI：
10.1023/a:1011283523000
复制
发表时间：
2001-12
期刊：
影响因子：
--
通讯作者：
N. Aydin;I. Siap;D. K. Ray-Chaudhuri
中科院分区：
文献类型：
--
作者：
N. Aydin;I. Siap;D. K. Ray-Chaudhuri
编码理论中最重要的问题之一是构造具有最佳可能最小距离的码。最近，准循环（QC）码已被证明包含许多这样的代码。本文研究了QC码的推广&准扭（quasi-twisted，QT）码及其结构性质，得到了改进有限域GF（3）和GF（5）上最佳线性码的最小距离的新码。此外，我们还给出了QT码的最小距离的BCH型界，并给出了QT码等价于QC码的一个充分条件。
One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over the finite fieldsGF(3) andGF(5). Moreover, we give a BCH-type bound on minimum distance for QT codes and give a sufficient condition for a QT code to be equivalent to a QC code.