For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
The Bases Associated with Trellises of a Lattice
Haibin KAN Hong SHEN
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/07/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
lattices, dual lattices, trellises, Viterbi algorithm,
Full Text: PDF(96.5KB)>>
It is well known that the trellises of lattices can be employed to decode efficiently. It was proved in  and  that if a lattice L has a finite trellis under the coordinate system , then there must exist a basis (b1,b2,,bn) of L such that Wi=span() for 1in. In this letter, we prove this important result in a completely different method, and give an efficient method to compute all bases of this type.