Codes closed under arbitrary abelian group of permutations

被引：1

作者：

Dey, BK ^{[1
]}

Rajan, BS ^{[1
]}

机构：

[1] Indian Inst Sci, Dept ECE, Bangalore 560012, Karnataka, India

来源：

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ISIT.2002.1023473

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Algebraic structure of codes closed under arbitrary abelian group G of permutations is investigated resulting in insight into Dual of G-invariant codes and Self-dual G-invariant codes. For special types of the groups, these codes give cyclic, abelian, quasi-cyclic and quasi-abelian codes. Karlin's decoding algorithm for systematic one-generator quasi-cyclic codes is extended for systematic quasi-abelian codes with any number of generators.

引用

页码：201 / 201

页数：1