Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers

DOI10.1007/978-3-030-54074-6_5MaRDI QIDQ2221111zbMATH OpenOpenAlexFDO

Authors Hannes Bartz, Emna Ben Yacoub, Lorenza Bertarelli, Gianluigi Liva

Publication date 26 January 2021

Full work available at URL https://arxiv.org/abs/2002.02696

zbMATH Keywords

McEliece cryptosystemcode-based cryptographyLDPC codesHamming weight amplifiers

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Quantum cryptography (quantum-theoretic aspects) (81P94) Decoding (94B35)

Abstract: A new protograph-based framework for message passing (MP) decoding of low density parity-check (LDPC) codes with Hamming weight amplifiers (HWAs), which are used e.g. in the NIST post-quantum crypto candidate LEDAcrypt, is proposed. The scheme exploits the correlations in the error patterns introduced by the HWA using a turbo-like decoding approach where messages between the decoders for the outer code given by the HWA and the inner LDPC code are exchanged. Decoding thresholds for the proposed scheme are computed using density evolution (DE) analysis for belief propagation (BP) and ternary message passing (TMP) decoding and compared to existing decoding approaches. The proposed scheme improves upon the basic approach of decoding LDPC code from the amplified error and has a similar performance as decoding the corresponding moderate-density parity-check (MDPC) code but with a significantly lower computational complexity.

Recommendations

• The construction of low-density parity-check codes based on protograph
• Graph-based iterative decoding algorithms for parity-concatenated trellis codes
• Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs
• Low-complexity error correction of Hamming-code-based LDPC codes
• Generalized Hamming weights of projective Reed-Muller-type codes over graphs
• Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
• scientific article; zbMATH DE number 4216926
• Weight enumerators of high-rate convolutional codes based on the Hamming code
• Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
• Publication:4945360

This page was built for publication: Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221111)