论文标题
新的线性代码作为长constacyclic代码的准扭曲代码
New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes
论文作者
论文摘要
编码理论中最重要，最具挑战性的问题之一是确定线性代码参数的最佳值，并以最佳参数明确构建代码，或者尽可能接近最佳值。在这方面，准倾斜（QT）代码的类别非常有前途。在过去的几十年中，已经采用了各种搜索算法来构建具有更好参数的QT代码。这些算法中的大多数（例如ASR）首先连接较小长度的constacyclic代码，以获得更长长度的QT代码。有一种算法以相反的方式起作用，该算法从长constacyclic代码中构造了较短的QT代码。我们修改并概括了该算法，并通过其实现获得了新的线性代码。我们还观察到新算法与ASR算法有关。
One of the most important and challenging problems in coding theory is to determine the optimal values of the parameters of a linear code and to explicitly construct codes with optimal parameters, or as close to the optimal values as possible. The class of quasi-twisted (QT) codes has been very promising in this regard. Over the past few decades various search algorithms to construct QT codes with better parameters have been employed. Most of these algorithms (such as ASR) start by joining constacyclic codes of smaller lengths to obtain QT codes of longer lengths. There has been an algorithm that works in the opposite way that constructs shorter QT codes from long constacyclic codes. We modified and generalized this algorithm and obtained new linear codes via its implementation. We also observe that the new algorithm is related to the ASR algorithm.
