Using algebraic structures to improve LDPC code reconstruction over a noisy channel

Pierre Loidreau (1)

1 IRMAR - Institut de Recherche Mathématique de Rennes

In this paper we show that algebraic structure of codes can be used to improve dramatically the efficiency of code reconstructions techniques especially in the case of quasi-cyclic LDPC codes of large block sizes which are widely used in standards. We focus on the case where the receiver gets noisy blocks, but the principle could be used in the case of non noisy reception. We also show that the smoother the length of the quasi-cycle is, the better the trade-off can be tuned.

Domaines: Cryptographie et sécurité [cs.CR]; Théorie de l'information et codage [math.IT]

Pierre Loidreau. Using algebraic structures to improve LDPC code reconstruction over a noisy channel. International Symposium on Information Theory ISIT 2019, Jul 2019, Paris, France. pp.2439-2443, ⟨10.1109/ISIT.2019.8849756⟩. ⟨hal-02387819⟩