Name
Title | ||
|---|---|---|
Optimal Space-Time Block Code Designs Based on Irreducible Polynomials of Degree Two. |
Abstract | ||
|---|---|---|
The main of this paper is to prove that in terms of normalized density, a space-time block code based on an irreducible quadratic polynomial over the Eisenstein integers is an optimal space-time block code compared with any quadratic space-time block code over the ring of integers of imaginary quadratic fields. In addition we find the optimal design of space-time block codes based on an irreducible quadratic polynomial over some rings of imaginary quadratic fields. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Information Theory | Journal |
Volume | Citations | PageRank |
abs/1901.06200 | 0 | 0.34 |
References | Authors | |
21 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carina Alves | 1 | 97 | 11.95 |
| Eliton M. Moro | 2 | 0 | 0.34 |