Sciweavers

412 search results - page 6 / 83
» New Set of Codes for the Maximum-Likelihood Decoding Problem
Sort
View
CORR
2006
Springer
81views Education» more  CORR 2006»
14 years 9 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
76
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
Luay Azzam, Ender Ayanoglu
106
Voted
PAMI
2010
170views more  PAMI 2010»
14 years 8 months ago
On the Decoding Process in Ternary Error-Correcting Output Codes
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
Sergio Escalera, Oriol Pujol, Petia Radeva
CORR
2010
Springer
261views Education» more  CORR 2010»
14 years 7 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
CORR
2011
Springer
166views Education» more  CORR 2011»
14 years 1 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier