Dey, B. K. ; Rajan, B. S. (2002) Codes closed under arbitrary abelian group of permutations In: Proceedings of the 2002 IEEE Information Theory Workshop, 2002, 30 June-5 July 2002, Lausanne, Switzerland.
Full text not available from this repository.
Official URL: http://ieeeexplore.ws/document/1023473/?reload=tru...
Related URL: http://dx.doi.org/10.1109/ISIT.2002.1023473
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 quasi-abelian codes with any number of generators.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111243 |
| Deposited On: | 08 Dec 2017 10:36 |
| Last Modified: | 08 Dec 2017 10:36 |
Repository Staff Only: item control page
