Generalized quasi-cyclic codes: structural properties and code construction

被引:47
|
作者
Esmaeili, M. [1 ]
Yari, S. [1 ]
机构
[1] Isfahan Univ Technol, Dept Math Sci, Esfahan 8415683111, Iran
关键词
Generalized quasi-cyclic code; Code decomposition; Code construction; ALGEBRAIC STRUCTURE; CONVOLUTIONAL-CODES;
D O I
10.1007/s00200-009-0095-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Generalized quasi-cyclic (GQC) codes are defined by generator matrices comprised of circulant matrices of lengths not necessarily identical. A decomposition of these codes is given by using the Chinese reminder theorem. The focus is to characterize rho-generator GQC codes in details. A good lower bound on the minimum distance of such a code in terms of the minimum distance of the constituent codes is given. Construction methods are given and a set of GQC codes is provided that from minimum distance perspective are optimal codes among the known linear codes having the same length and dimension.
引用
收藏
页码:159 / 173
页数:15
相关论文
共 50 条