4 problems

Let $\mathcal{X}$ be an $L$-block $n_t \times T$ space--time code completely over $\mathcal{A}$, and let the horizontal and vertical slicing constructions be as in the preceding pr…

The Srinath–Rajan code is a fast-decodable $4\times 2$ space-time code based on stacked coordinate-interleaved orthogonal designs, with its real and imaginary components separated…

Let $L$ be a lattice in $M_4(\mathbb{C})\cap M_2(\mathbf{H})$, where the normalized minimum determinant is measured for the lattice code. Optimality conjecture. We conjecture that…

Let a puncturation matrix have $N$ rows, where $N$ is the number of transmitting antennas, and let a basic pattern consist of $N$ zeros used as a building block for constructing su…