Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices

In this paper, the authors prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the literature are not proved to be capacity achieving. As opposed to the existing results in the literature, which are based on optimal maximum a posteriori decoders, the proposed approach is based on a different decoder and consequently is suboptimal.

Provided by: sharick Topic: Networking Date Added: Aug 2011 Format: PDF

Find By Topic