Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups

Details Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups

2007-02-05

arxiv.org/abs/cs/0702020v3

Computer Science

Information Theory

11 pages, submitted to IEEE Transactions on Information Theory

Scientific paper

A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who treated the case of a linear code over a field. We also present an efficient algorithm for constructing the minimal tail-biting trellis of a group code over a finite abelian group, given a generator matrix.

Affiliated with

Also associated with

No associations

Rating

Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714225