On optimal constacyclic codes
On optimal constacyclic codes
复制标题
DOI：
10.1016/j.laa.2016.02.014
复制
发表时间：
2013-11
期刊：
影响因子：
--
通讯作者：
G. L. Guardia
中科院分区：
文献类型：
--
作者：
G. L. Guardia
在本文中，我们构建了从经典常循环码派生的新的最大距离可分离（MDS）卷积码族。此外，我们还构建了几乎 MDS 块和卷积码的新系列。这里构造的大多数新卷积码都是单位存储器，且度γ= 2。此外，基于不同的方法，我们构造了文献中已知的非对称量子码族。所有这些结果主要来自对此类代码的分圆陪集的适当性质的研究。
In this paper we construct new families of maximum-distance-separable (MDS) convolutional codes derived from classical constacyclic codes. Additionally, we also construct new families of almost MDS block and convolutional codes. Most of the new convolutional codes constructed here are unit-memory and have degree γ= 2. Moreover, based on a different method, we construct families of asymmetric quantum codes known in the literature. All these results are mainly derived from the investigation of suitable properties on cyclotomic cosets of such codes.