The bases associated with trellises of a lattice

Haibin Kan; Hong Shen

doi:10.1093/ietfec/e88-a.7.2030

The bases associated with trellises of a lattice

Haibin Kan
, Hong Shen

研究成果: Article › 同行評審

5 引文斯高帕斯（Scopus）

摘要

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 {W_i}_i=1ⁿ, then there must exist a basis (b₁, b₂, ... ,b_n) of L such that W_i = span(b_i) 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.

原文	English
頁（從 - 到）	2030-2033
頁數	4
期刊	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
卷	E88-A
發行號	7
DOIs	https://doi.org/10.1093/ietfec/e88-a.7.2030
出版狀態	Published - 7月 2005
對外發佈	是

存取文件

10.1093/ietfec/e88-a.7.2030

其它文件與鏈接

Link to publication in Scopus

引用此

@article{c424a87f71614bb3a882fd98bbdc7256,

title = "The bases associated with trellises of a lattice",

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.",

keywords = "Dual lattices, Lattices, Trellises, Viterbi algorithm",

author = "Haibin Kan and Hong Shen",

year = "2005",

month = jul,

doi = "10.1093/ietfec/e88-a.7.2030",

language = "English",

volume = "E88-A",

pages = "2030--2033",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "7",

}

TY - JOUR

T1 - The bases associated with trellises of a lattice

AU - Kan, Haibin

AU - Shen, Hong

PY - 2005/7

Y1 - 2005/7

N2 - 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.

AB - 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.

KW - Dual lattices

KW - Lattices

KW - Trellises

KW - Viterbi algorithm

UR - https://www.scopus.com/pages/publications/26044453634

U2 - 10.1093/ietfec/e88-a.7.2030

DO - 10.1093/ietfec/e88-a.7.2030

M3 - Article

AN - SCOPUS:26044453634

SN - 0916-8508

VL - E88-A

SP - 2030

EP - 2033

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 7

ER -

The bases associated with trellises of a lattice

摘要

存取文件

其它文件與鏈接

指紋

引用此