Techniques for Improving the Finite Length Performance of Sparse Superposition Codes
Techniques for Improving the Finite Length Performance of Sparse Superposition Codes
Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically capacity-achieving with computationally feasible decoding. However, a direct implementation of the capacity-achieving construction does not give …