2572 search results - page 67 / 515 » codes 2008 |
TIT
2002
14 years 10 months ago
2002
We consider transmission using transmit and reception using receive antennas in a wireless environment assuming that neither the transmitter nor the receiver knows the channel coef...
110
click to vote
NIPS
2008
15 years 15 days ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
TIT
2002
14 years 10 months ago
2002
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
TIT
2008
14 years 11 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
JSAC
2008
14 years 11 months ago
2008
Abstract--To implement network coding, users need to coordinate and cooperate with respect to their strategies in terms of duplicating and transmitting side information across spec...