Designing a Good Low-Rate Sparse-Graph Code

Iryna Andriyanova (1) , Jean-Pierre Tillich (2)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 SECRET - Security, Cryptology and Transmissions

This paper deals with the design of low-rate sparse-graph codes, having a linear minimum distance d_{min} in the blocklength n. Its main contributions are: a) a necessary condition on a general family of sparse-graph codes with linear d_{min}; b) a justification of having degree-1 bits in the low-rate code structure; c) a new, efficient ensemble of low-rate sparse-graph codes with bits of degree 1, designed so that the necessary condition (a) is satisfied.

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

Iryna Andriyanova, Jean-Pierre Tillich. Designing a Good Low-Rate Sparse-Graph Code. IEEE Transactions on Communications, 2012, pp.3181 - 3190. ⟨10.1109/TCOMM.2012.082712.100205⟩. ⟨hal-00770199⟩