Title :
Coding theorem for general stationary memoryless channel based on hash property
Author :
Muramatsu, Jun ; Miyake, Shigeki
Author_Institution :
NTT Commun. Sci. Labs., NTT Corp., Seika, Japan
fDate :
June 28 2009-July 3 2009
Abstract :
The aim of this paper is to prove the achievability of the general (asymmetric) channel coding problem based on the hash property. Since an ensemble of q-ary sparse matrices (the maximum column weight grows logarithmically in the block length) satisfies the hash property, it is proved that the rate of codes using sparse matrices can achieve the channel capacity.
Keywords :
channel capacity; channel coding; sparse matrices; asymmetric channel coding; block length; channel capacity; coding theorem; general stationary memoryless channel; hash property; maximum column weight; q-ary sparse matrices; Channel capacity; Channel coding; Gold; Laboratories; Linear code; Memoryless systems; Parity check codes; Probability distribution; Sparse matrices; Sufficient conditions; LDPC codes; channel coding; hash property; linear codes; shannon theory; sparse matrix;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205728
