Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 220

The DOI matches its Crossref record.

Coded diversity on block-fading channels

Malkamaki, E., Leib, H. · 1999 · IEEE Transactions on Information Theory

Abstract

This paper considers coded diversity schemes over block-fading Rician channels using random coding techniques. Two random coding upper bounds on the error probability of block codes are derived: a new bound and a simpler but looser bound assuming binary input distribution. Also, a new lower bound for any block code is derived using the strong converse to channel coding theorem. The lower bound shows that the new random coding upper bound is quite tight. Furthermore, it is shown that the maximum achievable diversity order in a block-fading channel with finite interleaving depends not only on the number of subchannels L, but also on the code rate R and that the performance can only marginally be improved by increasing the block length of the code. The random coding upper bound and the lower bound are shown to converge to the capacity outage for large channel block lengths N, demonstrating that the capacity outage can be used for estimating the error probability of coded diversity schemes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/18.749028

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

Metadata

Authors
Malkamaki, E., & Leib, H.
Venue
IEEE Transactions on Information Theory
Published
1999-03
Volume
45
Issue
2
Pages
771-781
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2166099870
Cited by
220
References
0
FWCI
12.90
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.