19 search results - page 2 / 4 » On the Characterization of Linear Uniquely Decodable Codes |
TIT
2008
13 years 5 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initiall...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract--This paper examines the performance of decisionfeedback-based iterative channel estimation and multiuser detection in channel coded aperiodic direct sequence code divisio...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...