
An improved pre-factor for the random coding bound is proved. Specifically, for positive dispersion channels, if a certain regularity condition is satisfied, then for any ∊ > 0 a pre-factor of 0(N−½(1−∊+ρ∗w(R))) is achievable for rates above the critical rate, where ρ∗w (R) is related to the slope of the random coding bound at rate R. If the regularity condition is not satisfied, then a pre-factor of 0(N−½) is achievable. Recent work of the authors shows that the former case is nearly the best possible.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
