Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Does the performance of LDPC code $C$ depends on the covering radius, $Cr(C)$?

share|improve this question

1 Answer 1

up vote 1 down vote accepted

The performance of $LDPC$ code $C$ depends on a lot of parameters as like as: 1) regularity or irregularity 2) stopping set 3) the channel for simulation ($BSC$ or $AWGN$ channel or others) 4) the decoding algorithm 5) rate and minimum distance of code and some new parameters that introduced in many paper with this subject. Also you can see a paper with name "Does the performance of $LDPC$ codes depend on channels?"

But in general, this question isn't solve completely. I think in iterative decoding, the covering radius is not so important. We have $LDPS$ codes with large covering radius that has very good performance and also we have $LDPC$ codes with small covering radius that has good performance. The covering radius is very important parameter in source coding as like as compression. In channel coding, it is not so important.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.