Performance analysis of delay-constrained communications over slow Rayleigh fading channels
IEEE Transactions on Wireless Communications
Low-density generator matrix codes for indoor and markov channels
IEEE Transactions on Wireless Communications
Capacity, mutual information, and coding for finite-state Markov channels
IEEE Transactions on Information Theory
Analysis of low-density parity-check codes for the Gilbert-Elliott channel
IEEE Transactions on Information Theory
Simulation-Based Computation of Information Rates for Channels With Memory
IEEE Transactions on Information Theory
A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
In this paper, an ordering result is given for Markov channels with respect to mutual information, under the assumption of an independent and identically distributed (i.i.d.) input distribution. For those Markov channels in which the capacity-achieving input distribution is i.i.d., this allows ordering of the channels by capacity. The complexity of analyzing general Markov channels is mitigated by this ordering, since it is possible to immediately determine that a wide class of channels, with different numbers of states, has a smaller mutual information than a given channel.