arXiv (All)
open access
Learning Joint Synchronization, Channel Estimation, and Decoding: Comparison with a Finite-Blocklength Achievability Bound
Learned schemes that jointly perform tasks such as synchronization and decoding have achieved promising results for short-packet communication. However, it remains unclear how close their performance is to information-theoretic bounds. To investigate this question, we extend the turbo autoencoder (T
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Adaptive Coded Federated Learning: Privacy Preservation and Straggler Mitigation#1317998
- Asymptotic and finite-length optimization of LDPC codes#401929
- On the Adversarial Vulnerability of Neural Receivers with Unrolled LDPC Decoders#1423137
- On the Adversarial Vulnerability of Neural Receivers with Unrolled LDPC Decoders#1417790
- Aligned Training: A Parameter-Free Method to Improve Feature Quality and Stability of Sparse Autoencoders (SAE)#200496
Record · ID 1534750
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive