Generalized quasi-cyclic codes: structural properties and code construction

详细信息    查看全文

• 作者：M. Esmaeili and S. Yari
• 关键词：Generalized quasi ; cyclic code ; Code decomposition ; Code construction
• 刊名：Applicable Algebra in Engineering, Communication and Computing
• 出版年：2009
• 出版时间：June, 2009
• 年：2009
• 卷：20
• 期：2
• 页码：159-173
• 全文大小：189.2 KB

文摘

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 ρ-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.