A $2\times 2$ lattice space-time code of rank $5$

Xing, Chaoping; Li, Wei

doi:10.1090/s0002-9939-08-09449-5

Cited by 3 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One obvious lower bound is r(n) ≥ 2n (see [1], [2], [7], [8], [9]). Recently, Xing and Li [14] gave an upper bound r(n) ≤ 2n 2 . The case n = 2 is of a particular interest.…”

Section: 1) δ(A) := Inf{| Det(a − B)| : a B ∈ A A = B}mentioning

confidence: 99%

“…However, even in this case, we only know that 4 ≤ r(n) ≤ 8. No 2 × 2 lattice space-time codes of rank greater than 4 with a positive diversity product had been constructed until in [14], Xing and Li gave an example of a 2×2 lattice space-time code of rank 5 with a positive diversity product and raised the following question.…”

Section: 1) δ(A) := Inf{| Det(a − B)| : a B ∈ A A = B}mentioning

confidence: 99%

“…In recent years, the study of space-time codes has generated much interest. Many mathematical areas such as number theory, algebra, combinatorics, etc., have been employed to construct good lattice codes ( [1], [2], [5], [6], [7], [8], [11], [9], [12], [13], [14]). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A $2\times 2$ lattice space-time code of the highest rank

Yang

Togbé

2009

Proc. Amer. Math. Soc.

View full text Add to dashboard Cite

Abstract. For all previous constructions of 2 × 2 lattice space-time codes with a positive diversity product, the rank r(2) was such that r(2) ≤ 4. An example of a 2 × 2 lattice space-time code of rank 5 with a positive diversity product was given by Xing and Li. In this paper, we give an example of a 2 × 2 lattice space-time code of rank 8 with a positive diversity product. This gives an answer to the open problem set by Xing and Li.

show abstract

“…One obvious lower bound is r(n) ≥ 2n (see [1], [2], [7], [8], [9]). Recently, Xing and Li [14] gave an upper bound r(n) ≤ 2n 2 . The case n = 2 is of a particular interest.…”

Section: 1) δ(A) := Inf{| Det(a − B)| : a B ∈ A A = B}mentioning

confidence: 99%

Section: 1) δ(A) := Inf{| Det(a − B)| : a B ∈ A A = B}mentioning

confidence: 99%