Using algebraic structures to improve LDPC code reconstruction over a noisy channel
Pierre Loidreau · 2019
We show that the algebraic structure of codes can exploited to improve significantly the efficiency of code reconstructions techniques especially in the case of quasi-cyclic LDPC codes with large and smooth block sizes. Such codes are widely implemented in various standards. We investigate the case where the transmission is eavesdropped. The eaves dropper has access to noisy codewords which transited through a binary symmetric channel.