412 search results - page 1 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
CORR
2010
Springer
13 years 4 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...
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...
ETT
2000
13 years 4 months ago
2000
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
TIT
2008
13 years 4 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...