论文标题
低复杂性算法，用于传输短块在BSC上传播，并提供全面反馈
Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback
论文作者
论文摘要
本文以Horstein，Shayevitz和Feder的工作为基础，以及Naghshvar \ Emph {等{等}，本文提出了用于低复杂性的算法，用于通过二进制对称性通道（BSC）的低复杂顺序传输，并具有完整的，无噪声的反馈。为了降低复杂性，本文表明，在需要任何反馈之前，可以发送最初的$ K $二进制传输，并将具有相等后验的消息分组，以减少从$ k $ in $ k $ in $ k $的$ k $的后验更新数量。仿真结果表明，这种完整的无噪声反馈系统方法的可实现速率迅速作为平均区块长度的函数，比已知的有限块长度下限快于可实现的速率，并且无噪声的主动反馈，并且比有限的块长度下限的速度要快得多。
Building on the work of Horstein, Shayevitz and Feder, and Naghshvar \emph{et al.}, this paper presents algorithms for low-complexity sequential transmission of a $k$-bit message over the binary symmetric channel (BSC) with full, noiseless feedback. To lower complexity, this paper shows that the initial $k$ binary transmissions can be sent before any feedback is required and groups messages with equal posteriors to reduce the number of posterior updates from exponential in $k$ to linear in $k$. Simulation results demonstrate that achievable rates for this full, noiseless feedback system approach capacity rapidly as a function of average blocklength, faster than known finite-blocklength lower bounds on achievable rate with noiseless active feedback and significantly faster than finite-blocklength lower bounds for a stop feedback system.
