The asymptotic spectrum of two ensembles of q-ary LDPC codes, one consisting of (almost entirely) binary matrices, the other of q-ary matrices was derived. It was shown that both the ensembles are good as the graph connectivity increases, in the sense that their spectrum approaches that of the random linear ensembles over Zq and that they allow to approach the random coding error exponent of modulo additive noise channels.
|Number of pages
|IEEE International Symposium on Information Theory - Proceedings
|Published - 2003
|Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: 29 Jun 2003 → 4 Jul 2003