In this letter, the Engdahl-Zigangirov (E&Z) bound is generalized to block-fading channels. For a quasi-static fading channel, we demonstrate that it is tighter than the Malkamaki-Leib (M&L) bound by about 4 dB. As the, number of fading blocks M increases, the improvement of,the bound lessens but the potential computation saving becomes more pronounced.TelecommunicationsSCI(E)EI1ARTICLE8726-728
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose ...
This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and er...
A union bound on the error probability of coded multi-antenna systems over block fading channels is ...
In this paper, we propose a new upper bound on the error performance of binary linear codes over blo...
We derive upper bounds on the decoding error probability of binary block codes over noncoherent bloc...
We investigate novel inner and outer bounds on the rate region of a 2-user Gaussian broadcast channe...
We derive here improved upper bounds on the error probability of block codes which are transmitted o...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
In practice, a communication system works with finite blocklength codes because of the delay constra...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
This paper investigates the maximal achievable rate for a given blocklength and error probability ov...
A union bound on the error probability of coded multi-antenna systems over block fading channels is ...
It is well known that the mutual information between two random variables can be expressed as the di...
A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β fu...
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose ...
This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and er...
A union bound on the error probability of coded multi-antenna systems over block fading channels is ...
In this paper, we propose a new upper bound on the error performance of binary linear codes over blo...
We derive upper bounds on the decoding error probability of binary block codes over noncoherent bloc...
We investigate novel inner and outer bounds on the rate region of a 2-user Gaussian broadcast channe...
We derive here improved upper bounds on the error probability of block codes which are transmitted o...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
In practice, a communication system works with finite blocklength codes because of the delay constra...
Block-fading is a popular channel model that approximates the behavior of different wireless communi...
This paper investigates the maximal achievable rate for a given blocklength and error probability ov...
A union bound on the error probability of coded multi-antenna systems over block fading channels is ...
It is well known that the mutual information between two random variables can be expressed as the di...
A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β fu...
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose ...
This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and er...
A union bound on the error probability of coded multi-antenna systems over block fading channels is ...