104 search results - page 17 / 21 » Decoder Error Probability of MRD Codes |
84
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
61
Voted
TIT
2008
14 years 9 months ago
2008
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...