On coding for block fading channels

By R. Knopp, P. Humblet. IEEE Transactions on Information Theory, 2000

458 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Universal space-time coding (2003, background): “It is also worth noting that a suitable class of SISO codes satisfying Theorem 4 contains the codes optimized for block-fading channels [25].”
Bit-Interleaved Coded Modulation (2008, background): “6) where dsb is the slope of the outage probability in a log-log scale and is given by the Singleton bound [61,70]”
Practical relay networks: a generalization of hybrid-ARQ (2005, background): “While the fading coefficients may have any arbitrary distribution and correlation (both temporally and spatially), it is common to assume that the coefficients are Rayleigh (or Rician) distributed and independent from both block-to-block and node-to-node [27].”
Cooperative coding for wireless networks (2004, methodology): “Note that [ 5 ] only has rate- example codes for a block-fading channel with two blocks, but this rate may not be suitable for cooperation in a wireless environment, since the interuser portion of the code would have rate 1 and effectively corresponds to uncoded transmission.”