A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

2007
*
IEEE Transactions on Information Theory
*

2977 pN pdf of noise, continuous-valued RDP. 2 Maximum average power in query sequence. 2 n Maximum average power in noise. P Conditional privacy loss. I w Worst-case information. g(:) ML estimate function. S i ML estimate of S i . S ML estimate of S. ! m Maximum probability of error. M Alphabet for X i . M Number of possible values of X. m Number of queries per bit determined. 3m Lower bound on i 8i m. min limm!1 3m. 8 RDP channel. C(8) Capacity of 8. Small bias of discrete RDP. E m Average

doi:10.1109/tit.2007.901177
fatcat:ovec53ai25dapfqbf4jrnzn7xa