In this paper we propose an efficient and general method to obtain structured generator matrices for QC-LDPC codes. Moreover, we devote particular attention to the family of fully-connected monomial codes and perform a statistical analysis of their low-weight unavoidable codewords, whose weight gives an upper bound on their minimum distance.
Obtaining structured generator matrices for QC-LDPC codes / Battaglioni, M., Santini, P., Baldi, M., Cancellieri, G.. - ELETTRONICO. - (2019). (2019 AEIT International Annual Conference Florence, Italy 18-20 September 2019) [10.23919/AEIT.2019.8893395].
Obtaining structured generator matrices for QC-LDPC codes
Battaglioni, Massimo
;Santini, Paolo;Baldi, Marco;Cancellieri, Giovanni
2019-01-01
Abstract
In this paper we propose an efficient and general method to obtain structured generator matrices for QC-LDPC codes. Moreover, we devote particular attention to the family of fully-connected monomial codes and perform a statistical analysis of their low-weight unavoidable codewords, whose weight gives an upper bound on their minimum distance.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
