Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback
share
Building on the work of Horstein, Shayevitz and Feder, and Naghshvar 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 the messages with equal posteriors to reduce the number of posterior updates from exponential in k to linear in k. Simulations results demonstrate the achievable rates for this full, noiseless feedback system approach capacity rapidly as a function of k, significantly faster than the achievable rate curve of Polyanskiy et al. for a stop feedback system.
READ FULL TEXT