On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble

Details On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble

2005-02-22

arxiv.org/abs/cs/0502084v1

Computer Science

Information Theory

To be presented at the 2005 Conference on Information Sciences and Systems

Scientific paper

Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes on memoryless binary-input/symmetric-output channels. The case of non-symmetric channels is tackled either by the LDPC coset code ensemble (a channel symmetrizing argument) or by the generalized DE for linear codes on non-symmetric channels. Existing simulations show that the bit error rate performances of these two different approaches are nearly identical. This paper explains this phenomenon by proving that as the minimum check node degree $d_c$ becomes sufficiently large, the performance discrepancy of the linear and the coset LDPC codes is theoretically indistinguishable. This typicality of linear codes among the LDPC coset code ensemble provides insight into the concentration theorem of LDPC coset codes.

Affiliated with

Also associated with

No associations

Rating

On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471828