arXiv (All)
open access
A Tight Second-Order Converse Bound for Variable-Length Feedback Codes
We study variable-length feedback (VLF) codes over a discrete memoryless channel under average decoding-time and error-probability constraints. In the non-vanishing error probability regime, Polyanskiy, Poor, and Verdú (2011) derive achievability and converse bounds on the logarithm of the maximum a
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
- Sparse multi-decoder recursive projection aggregation for Reed-Muller codes#476216
- Bounds on Codes Correcting Adjacent Transpositions#609817
- Decoding rank metric Reed-Muller codes#153696
- Mutually orthogonal anti-Latin squares#799315
- Mutually orthogonal anti-Latin squares#797892
Record · ID 998902
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