In this paper, collocated and distributed space-time block codes (DSTBCs) which admit
multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is …

The idea of space-time coding devised for multiple-antenna systems is applied to the
problem of communication over a wireless relay network, a strategy called distributed space …

Distributed orthogonal space-time block codes (DOSTBCs) achieving full-diversity order and
single-symbol maximum-likelihood (ML) decodability have been introduced recently by Yi …

In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices
as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is …

" Extended Clifford algebras" are introduced as a means to obtain low ML decoding
complexity space-time block codes. Using left regular matrix representations of two specific …

The problem of designing high rate, full diversity noncoherent space-time block codes
(STBCs) with low encoding and decoding complexity is addressed. First, the notion of p …

Jing and Hassibi introduced a distributed space time block coding scheme for symbol
synchronous, coherent, amplify and forward relay networks with half duplex constrained …

In this paper, we give a new framework for constructing low ML decoding complexity space-
time block codes (STBCs) using codes over the Klein group K. Almost all known low ML …

In cognitive radio systems, secondary users should continuously sense the licensed
spectrum in case a primary user starts to transmit. Whether or not the secondary users can …

In this paper, we give a new framework for constructing low ML decoding complexity Space-
Time Block Codes (STBCs) using codes over the finite field $\mathbb {F} _4 $. Almost all …