Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers
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 introduc...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Bartz, Hannes Yacoub, Emna Ben Bertarelli, Lorenza Liva, Gianluigi |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2002.02696 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2002_02696</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2002_02696</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-5b98946e1a34a180c9bfbc3b53b70e451b31dbd7f0e6df449429ab37a375baee3</originalsourceid><addsrcrecordid>eNotz71qwzAYhWEtGUrSC-hU3YBdyfqxNaZO0xQMyRDoaD5Zn2xBXBnZ9OfuS9JOZ3jhwEPIA2e5rJRiT5C-w2deMFbkrNBG35H9KcUl9gmmIXuGGR3dYRdd-Ohp9LTZnWpaR4cz_QrLQA8wjtf0jqEfFrodp0vwAdO8ISsPlxnv_3dNzvuXc33ImuPrW71tMtClzpQ1lZEaOQgJvGKdsd52wiphS4ZScSu4s670DLXzUhpZGLCiBFEqC4hiTR7_bm-QdkphhPTTXkHtDSR-AWPwRXY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers</title><source>arXiv.org</source><creator>Bartz, Hannes ; Yacoub, Emna Ben ; Bertarelli, Lorenza ; Liva, Gianluigi</creator><creatorcontrib>Bartz, Hannes ; Yacoub, Emna Ben ; Bertarelli, Lorenza ; Liva, Gianluigi</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2002.02696</identifier><language>eng</language><subject>Computer Science - Cryptography and Security ; Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2020-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2002.02696$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2002.02696$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bartz, Hannes</creatorcontrib><creatorcontrib>Yacoub, Emna Ben</creatorcontrib><creatorcontrib>Bertarelli, Lorenza</creatorcontrib><creatorcontrib>Liva, Gianluigi</creatorcontrib><title>Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers</title><description>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.</description><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71qwzAYhWEtGUrSC-hU3YBdyfqxNaZO0xQMyRDoaD5Zn2xBXBnZ9OfuS9JOZ3jhwEPIA2e5rJRiT5C-w2deMFbkrNBG35H9KcUl9gmmIXuGGR3dYRdd-Ohp9LTZnWpaR4cz_QrLQA8wjtf0jqEfFrodp0vwAdO8ISsPlxnv_3dNzvuXc33ImuPrW71tMtClzpQ1lZEaOQgJvGKdsd52wiphS4ZScSu4s670DLXzUhpZGLCiBFEqC4hiTR7_bm-QdkphhPTTXkHtDSR-AWPwRXY</recordid><startdate>20200207</startdate><enddate>20200207</enddate><creator>Bartz, Hannes</creator><creator>Yacoub, Emna Ben</creator><creator>Bertarelli, Lorenza</creator><creator>Liva, Gianluigi</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200207</creationdate><title>Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers</title><author>Bartz, Hannes ; Yacoub, Emna Ben ; Bertarelli, Lorenza ; Liva, Gianluigi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-5b98946e1a34a180c9bfbc3b53b70e451b31dbd7f0e6df449429ab37a375baee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Bartz, Hannes</creatorcontrib><creatorcontrib>Yacoub, Emna Ben</creatorcontrib><creatorcontrib>Bertarelli, Lorenza</creatorcontrib><creatorcontrib>Liva, Gianluigi</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bartz, Hannes</au><au>Yacoub, Emna Ben</au><au>Bertarelli, Lorenza</au><au>Liva, Gianluigi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers</atitle><date>2020-02-07</date><risdate>2020</risdate><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.</abstract><doi>10.48550/arxiv.2002.02696</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2002.02696 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2002_02696 |
| source | arXiv.org |
| subjects | Computer Science - Cryptography and Security Computer Science - Information Theory Mathematics - Information Theory |
| title | Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T12%3A36%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Protograph-Based%20Decoding%20of%20LDPC%20Codes%20with%20Hamming%20Weight%20Amplifiers&rft.au=Bartz,%20Hannes&rft.date=2020-02-07&rft_id=info:doi/10.48550/arxiv.2002.02696&rft_dat=%3Carxiv_GOX%3E2002_02696%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |