Computation and Reformation of the Minimum Distance and Check Array of QC LDPC Codes

Based on the principles of linear algebra and linear block codes, a method is proposed to calculate the minimum distance of a group of QC LDPC codes as well as other kinds of linear block codes.A estimation of time complexity is stated too.A method of generating larger minimum distance by reforming the check array is given for QC LDPC codes based on its special structure.