2621 search results - page 71 / 525 » Near orders and codes |
116
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this...
130
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a new decoding method inspired by Mitzenmacher’s idea of adding a different pseudo-random number to each packet, in a packet-symbol (n, k) code, for verificat...
127
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
—Based on an EXtrinsic Information Transfer (EXIT) chart-assisted receiver design, a low-complexity near-Maximum A Posteriori (MAP) detector is constructed for high-throughput sy...