LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks
Open accessThe DOI matches its Crossref record; 52 of the 56 references it cites were found in a registry or an index.
Abstract
Designing channel codes under low latency constraints is one of the most demanding requirements in 5G standards. However, sharp characterizations of the performances of traditional codes are only available in the large block lengths limit. Code designs are guided by those asymptotic analyses and require large block lengths and long latency to achieve the desired error rate. Furthermore, when the codes designed for one channel (e.g. Additive White Gaussian Noise (AWGN) channel) are used for another (e.g. non-AWGN channels), heuristics are necessary to achieve any non trivial performance - thereby severely lacking in robustness as well as adaptivity. Obtained by jointly designing recurrent neural network (RNN) based encoder and decoder, we propose an end-to-end learned neural code which outperforms canonical convolutional code under block settings. With this gained experience of designing a novel neural block code, we propose a new class of codes under low latency constraint - Low-latency Efficient Adaptive Robust Neural (LEARN) codes, which outperform the state-of-the-art low latency codes as well as exhibit robustness and adaptivity properties. LEARN codes show the potential of designing new versatile and universal codes for future communications via tools of modern deep learning coupled with communication engineering insights.
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.
Integrity signals
Registry
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“RNNs are a commonly employed and familiar algorithm in the discipline of DL [63–65].”
From Review of deep learning: concepts, CNN architectures, challenges, applications, future directions (2021) · cites this paper as [64]
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S., & Szegedy, C. (2015) · arXiv · doi:10.48550/arxiv.1502.03167 · Cited by 27,818
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Sequence to Sequence Learning with Neural Networks
Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Jaderberg, M., Simonyan, K., Zisserman, A., & Kavukcuoglu, K. (2015) · arXiv · doi:10.48550/arxiv.1506.02025 · Cited by 5,137
Research works printed but not linked: 3
- [39] Sanders, Geoffrey A, 'Effects of radar interference on LTE (FDD) eNodeB and UE receiver performance in the 3.5 GHz band." US Department of Commerce, National Telecommunications and Information Administration, 2014. -
- taranalli, 2015, CommPy Digital communication With Python
- [16] Goodfellow I, Bengio Y, Courville A. Deep learning. MIT press; 2016 Nov 10. -
Cited by
Review of deep learning: concepts, CNN architectures, challenges, applications, future directions
Alzubaidi, L., Zhang, J., Humaidi, A. J., Al-Dujaili, A., Duan, Y., Al-Shamma, O., Santamaría, J., Fadhel, M. A., Al-Amidie, M., & Farhan, L. (2021) · Journal of Big Data · doi:10.1186/s40537-021-00444-8 · Cited by 7,906
Wireless Image Transmission Using Deep Source Channel Coding With Attention Modules
Xu, J., Ai, B., Chen, W., Yang, A., Sun, P., & Rodrigues, M. (2022) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2021.3082521 · Cited by 511
DeepJSCC-f: Deep Joint Source-Channel Coding of Images With Feedback
Kurka, D. B., & Gunduz, D. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2987203 · Cited by 470
FPGA-based Deep Learning Inference Accelerators: Where Are We Standing?
Nechi, A., Groth, L., Mulhem, S., Merchant, F., Buchty, R., & Bereković, M. (2023) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3613963 · Cited by 115
When 5G Meets Deep Learning: A Systematic Review
Santos, G. L., Endo, P. T., Sadok, D. F. H., & Kelner, J. (2020) · Algorithms · doi:10.3390/a13090208 · Cited by 76
Metadata
- Authors
- Jiang, Y., Kim, H., Asnani, H., Kannan, S., Oh, S., & Viswanath, P.
- Affiliations
- University of Washington (US)
- University of Illinois Urbana-Champaign (US)
- Venue
- IEEE Journal on Selected Areas in Information Theory
- Published
- 2020-05
- Volume
- 1
- Issue
- 1
- Pages
- 207-216
- ISSN
- 1550-3607 (ISSN-L)
- 2641-8770
- OpenAlex
- W2902778901
- Cited by
- 87
- References
- 56
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 9 · 2023: 13 · 2022: 15 · 2021: 17 · 2020: 14
- FWCI
- 12.75
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- International Conference on Communications (publishedVersion)
- IEEE Journal on Selected Areas in Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- NSF (CCF-1651236, CIF-1908003, CIF-1703403, CNS-2002932, CNS-2002664)
- Intel
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Keywords
- recurrent neural networks, convolutional codes, 5G, AWGN channel, robustness, block codes
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks. https://app.cochat.ai/papers/10.1109/jsait.2020.2988577
- The paper
- Jiang, Y., Kim, H., Asnani, H., Kannan, S., Oh, S., & Viswanath, P. (2020). LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks. IEEE Journal on Selected Areas in Information Theory. https://doi.org/10.1109/jsait.2020.2988577
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.