Codes Closed under Arbitrary Abelian Group of Permutations

Dey, Bikash Kumar and Rajan, Sundar B (2002) Codes Closed under Arbitrary Abelian Group of Permutations. In: 2002 IEEE International Symposium on Information Theory, 30 June - 5 July, Lausanne, Switzerland, p. 201.

Preview

PDF Codes_Closed.pdf Download (136kB)

Abstract

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 quasicyclic codes is extended for systematic quasiabelian codes with any number of generators.

Item Type:	Conference Poster
Publisher:	IEEE
Additional Information:	Copyright 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:32
URI:	http://eprints.iisc.ac.in/id/eprint/8964

Actions (login required)

View Item