On the algebraic structure of quasi-cyclic codes III: generator theory
On the algebraic structure of quasi-cyclic codes III: generator theory
复制标题
DOI：
10.1109/tit.2005.850142
复制
发表时间：
2005-07
影响因子：
2.5
通讯作者：
S. Ling;P. Solé
中科院分区：
文献类型：
--
作者：
S. Ling;P. Solé
在第一部分和第二部分之后，我们将给定指数的拟循环码作为有限多项式环上的码来研究。这些后者的代码被中国剩余定理（CRT）分解，或等效的马特森-所罗门变换，成为更短的代码在更大的字母表的产品。我们的特点和列举自对偶单生成元准循环码在这种情况下。我们给出了一个算法，以消除一些等价的代码从该枚举。概括多生成器码的草图。
Following Parts I and II, quasi-cyclic codes of given index are studied as codes over a finite polynomial ring. These latter codes are decomposed by the Chinese Remainder Theorem (CRT), or equivalently the Mattson-Solomon transform, into products of shorter codes over larger alphabets. We characterize and enumerate self-dual one-generator quasi-cyclic codes in that context. We give an algorithm to remove some equivalent codes from that enumeration. A generalization to multigenerator codes is sketched.