The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
Open accessAbstract
In this paper, we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi-Poor-Verdù, and are investigated under parallel AWGN channels, the AWGN channel, the BI-AWGN channel, and the BSC. The technique we use, which is a generalization of some recent results available from the literature, is to map the probabilities of interest into a Laplace integral, and then solve (or approximate) the integral by use of a steepest descent technique. The proposed results are particularly useful for short packet lengths, where the normal approximation may provide unreliable results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Prudnikov, A. P., Brychkov, Y. A., Marichev, O. I., & Romer, R. H. (1988) · American Journal of Physics · doi:10.1119/1.15375 · Cited by 2,910
Cited by
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Short Block-Length Codes for Ultra-Reliable Low Latency Communications
Shirvanimoghaddam, M., Mohammadi, M. S., Abbas, R., Minja, A., Yue, C., Matuz, B., Han, G., Lin, Z., Liu, W., Li, Y., et al. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1800181 · Cited by 431
On Construction of Low-Density Parity-Check Codes for Ultra-Reliable and Low Latency Communications
Zou, L., Yan, H., Dong, J., Li, Y., Chen, P., & Lau, F. C. M. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3392774 · Cited by 12
Metadata
- Authors
- Erseghe, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-12
- Volume
- 62
- Issue
- 12
- Pages
- 6854-6883
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2272901026
- Cited by
- 161
- References
- 1
- FWCI
- 10.42
- Type
- journal article
- Language
- en
- Open access
- green
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.