Hi All
I am working on Euclidean Geometry LDPC codes. I implemented the Generator matrix for the parity check matrix using the method given in paper "Efficient Encoding of Quasi-Cyclic
Low-Density Parity-Check Codes" by Shu lin. After decoding with the parity check matrix I want to calculate the BER by comparing the decoded bits with the information bits. As the generator matrix is not completely systematic So I have difficulty in finding the position of information bits in the non systematic part of decoded bits. Does Any one know how to find the Information bits.