Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. It has been known that the numbers of states and labels at every level of any finite trellis diagrams of a lattice L and its dual L* under the same coordinate system are the same. In the paper, we present concrete expressions of the numbers of distinct paths in the trellis diagrams of L and L* under the same coordinate system, which are more concrete than Theorem 2 of [1]. We also give a relation between the numbers of edges in the trellis diagrams of L and L*. Furthermore, we provide the upper bounds on the state numbers of a trellis diagram of the lattice L1
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Haibin KAN, Hong SHEN, "Some Trellis Properties on Lattices" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 7, pp. 1979-1986, July 2005, doi: 10.1093/ietfec/e88-a.7.1979.
Abstract: Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. It has been known that the numbers of states and labels at every level of any finite trellis diagrams of a lattice L and its dual L* under the same coordinate system are the same. In the paper, we present concrete expressions of the numbers of distinct paths in the trellis diagrams of L and L* under the same coordinate system, which are more concrete than Theorem 2 of [1]. We also give a relation between the numbers of edges in the trellis diagrams of L and L*. Furthermore, we provide the upper bounds on the state numbers of a trellis diagram of the lattice L1
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.7.1979/_p
Copy
@ARTICLE{e88-a_7_1979,
author={Haibin KAN, Hong SHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Some Trellis Properties on Lattices},
year={2005},
volume={E88-A},
number={7},
pages={1979-1986},
abstract={Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. It has been known that the numbers of states and labels at every level of any finite trellis diagrams of a lattice L and its dual L* under the same coordinate system are the same. In the paper, we present concrete expressions of the numbers of distinct paths in the trellis diagrams of L and L* under the same coordinate system, which are more concrete than Theorem 2 of [1]. We also give a relation between the numbers of edges in the trellis diagrams of L and L*. Furthermore, we provide the upper bounds on the state numbers of a trellis diagram of the lattice L1
keywords={},
doi={10.1093/ietfec/e88-a.7.1979},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Some Trellis Properties on Lattices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1979
EP - 1986
AU - Haibin KAN
AU - Hong SHEN
PY - 2005
DO - 10.1093/ietfec/e88-a.7.1979
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2005
AB - Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. It has been known that the numbers of states and labels at every level of any finite trellis diagrams of a lattice L and its dual L* under the same coordinate system are the same. In the paper, we present concrete expressions of the numbers of distinct paths in the trellis diagrams of L and L* under the same coordinate system, which are more concrete than Theorem 2 of [1]. We also give a relation between the numbers of edges in the trellis diagrams of L and L*. Furthermore, we provide the upper bounds on the state numbers of a trellis diagram of the lattice L1
ER -