In this paper, we provide a general form for sparse generator matrices of several families of Quasi-Cyclic Low-Density Parity-Check codes. Codes of this kind have a prominent role in literature and applications due to their ability to achieve excellent performance with limited complexity. While some properties of these codes (like the girth length in their associated Tanner graphs) are well investigated, estimating their minimum distance is still an open problem. By obtaining sparse generator matrices for several families of these codes, we prove that they are also Quasi-Cyclic Low-Density Generator Matrix codes, which is an important feature to reduce the encoding complexity, and provides a useful tool for the investigation of their minimum distance.
Sparse generator matrices for some families of quasi-cyclic low-density parity-check codes / Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco. - ELETTRONICO. - (2014). (Intervento presentato al convegno 22nd International Conference on Software, Telecommunications & Computer Networks tenutosi a Split, Croatia nel 17-19 September 2014) [10.1109/SOFTCOM.2014.7039123].
Sparse generator matrices for some families of quasi-cyclic low-density parity-check codes
BALDI, Marco;CANCELLIERI, Giovanni;CHIARALUCE, FRANCO
2014-01-01
Abstract
In this paper, we provide a general form for sparse generator matrices of several families of Quasi-Cyclic Low-Density Parity-Check codes. Codes of this kind have a prominent role in literature and applications due to their ability to achieve excellent performance with limited complexity. While some properties of these codes (like the girth length in their associated Tanner graphs) are well investigated, estimating their minimum distance is still an open problem. By obtaining sparse generator matrices for several families of these codes, we prove that they are also Quasi-Cyclic Low-Density Generator Matrix codes, which is an important feature to reduce the encoding complexity, and provides a useful tool for the investigation of their minimum distance.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.