Rateless Autoencoder Codes: Trading off Decoding Delay and Reliability
Not on the map. Why?
Abstract (arXiv)
Most of today's communication systems are designed to target reliable message recovery after receiving the entire encoded message (codeword). However, in many practical scenarios, the transmission process may be interrupted before receiving the complete codeword. This paper proposes a novel rateless autoencoder (AE)-based code design suitable for decoding the transmitted message before the noisy codeword is fully received. Using particular dropout strategies applied during the training process, rateless AE codes allow to trade off between decoding delay and reliability, providing a graceful improvement of the latter with each additionally received codeword symbol. The proposed rateless AEs significantly outperform the conventional AE designs for scenarios where it is desirable to trade off reliability for lower decoding delay.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 28 Jan 2023.
Builds on
7 of 23 references.
References · 7
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017An Introduction to Deep Learning for the Physical Layercited by 227
- 2017Deep Learning-Based Communication Over the Aircited by 72
- 2018OFDM-Autoencoder for End-to-End Learning of Communications Systemscited by 28
- 2020Stochastic Bottleneck: Rateless Auto-Encoder for Flexible Dimensionality Reductioncited by 13
- 2019Autoencoder-Based Error Correction Coding for One-Bit Quantizationcited by 6
- 2018Achievable Information Rates for Nonlinear Fiber Communication via End-to-end Autoencoder Learningcited by 4
Built on by
Not cited yet.