33 search results - page 2 / 7 » Single-Symbol Maximum Likelihood Decodable Linear STBCs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
FTCIT
2006
13 years 5 months ago
2006
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
—An efficient maximum-likelihood decoder with a new reduction strategy is proposed for linear MIMO channel systems. Unlike the current reduction strategies which only reorder th...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...