Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
V.V. Vazirani , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
H. Saran , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
B.S. Rajan , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
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 (1995), 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//spl alpha/, where p is a prime. Such a code can be viewed as a submodule over the ring Z/sub p//spl 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.
group theory; finite Abelian groups; minimal trellises; group code; minimal trellis; efficient algorithm; cyclic groups; zero-divisors; submodule; linear combination; p-linear combination; p-generator sequence
H. Saran, B. Rajan and V. Vazirani, "An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 144.