The bases associated with trellises of a lattice

Haibin Kan, Hong Shen

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

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 {Wi}i=1n, then there must exist a basis (b1, b2, ... ,bn) of L such that Wi = span(bi) for 1 ≤ i ≥ n. 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.

Original languageEnglish
Pages (from-to)2030-2033
Number of pages4
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number7
DOIs
Publication statusPublished - Jul 2005
Externally publishedYes

Keywords

  • Dual lattices
  • Lattices
  • Trellises
  • Viterbi algorithm

Fingerprint

Dive into the research topics of 'The bases associated with trellises of a lattice'. Together they form a unique fingerprint.

Cite this