The Bases Associated with Trellises of a Lattice

Haibin KAN  Hong SHEN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A   No.7   pp.2030-2033
Publication Date: 2005/07/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.7.2030
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
lattices,  dual lattices,  trellises,  Viterbi algorithm,  

Full Text: PDF(96.5KB)>>
Buy this Article

It is well known that the trellises of lattices can be employed to decode efficiently. It was proved in [1] and [2] 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.