Construction of LDPC codes for higher burst-error detecting

Abstract

The coding of LDPC codes is focused on several aspects: high error-correction,low coding complexity and so on.All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity.A suboptimal scheme which is with emphasis on hamming-distance and its distribution was presented.The codes introduced from this scheme can detect all burst-errors within the length of check matrix’s rank and has no loss in performance of random-error-correction.

Keywords

• LDPC codes
• Gilbert limit
• column-correlation
• column principle Gaussian elimination