Sciweavers

9 search results - page 2 / 2
» On Undetected Error Probability of Binary Matrix Ensembles
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 5 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 5 months ago
Combining Beamforming and Space-Time Coding Using Noisy Quantized Feedback
The goal of combining beamforming and space-time coding is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time...
Siavash Ekbatani, Hamid Jafarkhani
JMLR
2002
89views more  JMLR 2002»
13 years 5 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 4 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...