An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups
- Indian Institute of Technology, Delhi (India)
We present an efficient algorithm for computing the minimal trellis for a group code over a finite Abelian group, given a generator matrix for the code. We also show how to compute a succinct representation of the minimal trellis for such a code, and present algorithms that use this information to efficiently compute local descriptions of the minimal trellis. This extends the work of Kschischang and Sorokine, who handled the case of linear codes over fields. An important application of our algorithms is to the construction of minimal trellises for lattices. A key step in our work is handling codes over cyclic groups C{sub p}{alpha}, where p is a prime. Such a code can be viewed as a submodule over the ring Z{sub p}{alpha}. Because of the presence of zero-divisors in the ring, submodules do not share the useful properties of vector spaces. We get around this difficulty by restricting the notion of linear combination to p-linear combination, and introducing the notion of a p-generator sequence, which enjoys properties similar to that of a generator matrix for a vector space.
- OSTI ID:
- 457646
- Report Number(s):
- CONF-961004-; TRN: 97:001036-0017
- Resource Relation:
- Conference: 37. annual symposium on foundations of computer science, Burlington, VT (United States), 13-16 Oct 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the 37th annual symposium on foundations of computer science; PB: 656 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Investigations of Beam Dynamics Issues at Current and Future Hadron Accelerators (Final Report)
A general non-Abelian density matrix renormalization group algorithm with application to the C{sub 2} dimer