Threshold Selection for Iterative Decoding of (v,w)-regular Binary Codes
Saved in:
| Title: | Threshold Selection for Iterative Decoding of (v,w)-regular Binary Codes |
|---|---|
| Authors: | Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi |
| Contributors: | A. Anastasopoulos, V. Tan, M. Wigger, M. Wilde, Annechini, Alessandro, Barenghi, Alessandro, Pelosi, Gerardo |
| Publisher Information: | IEEE USA |
| Publication Year: | 2025 |
| Collection: | RE.PUBLIC@POLIMI - Research Publications at Politecnico di Milano |
| Subject Terms: | Cryptography, Post-quantum Cryptography, code-based KEM, Bit-flipping Decoding Algorithm, Computer Security |
| Description: | Iterative bit flipping decoders are an efficient and effective choice for decoding codes which admit a sparse parity-check matrix. Among these, sparse (v,w)-regular codes, which include LDPC and MDPC codes, are of particular interest both for efficient data correction and the design of cryptographic primitives. Throughout the iterative decoding process, the bit flipping thresholds can be determined either statically or during the decoder execution, by using information coming from the initial syndrome value and its updates. In this work, we analyze a two-iterations parallel hard decision bit flipping decoder and propose concrete criteria for threshold determination, backed by a closed form model. In doing so, we introduce a new tightly fitting model for the distribution of the Hamming weight of the syndrome after the first decoder iteration and substantial improvements on the decoding failure rate (DFR) estimation with respect to existing approaches. |
| Document Type: | conference object |
| File Description: | ELETTRONICO |
| Language: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/isbn/979-8-3315-4399-0; info:eu-repo/semantics/altIdentifier/isbn/979-8-3315-4400-3; ispartofbook:IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, Michigan, USA, June 22-27, 2025; IEEE International Symposium on Information Theory (ISIT 2025); firstpage:1; lastpage:6; numberofpages:6; alleditors:A. Anastasopoulos, V. Tan, M. Wigger, M. Wilde; https://hdl.handle.net/11311/1289632; https://doi.org/10.1109/ISIT63088.2025.11195438 |
| DOI: | 10.1109/ISIT63088.2025.11195438 |
| Availability: | https://hdl.handle.net/11311/1289632 https://doi.org/10.1109/ISIT63088.2025.11195438 |
| Rights: | info:eu-repo/semantics/openAccess |
| Accession Number: | edsbas.5CD4A50C |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Iterative bit flipping decoders are an efficient and effective choice for decoding codes which admit a sparse parity-check matrix. Among these, sparse (v,w)-regular codes, which include LDPC and MDPC codes, are of particular interest both for efficient data correction and the design of cryptographic primitives. Throughout the iterative decoding process, the bit flipping thresholds can be determined either statically or during the decoder execution, by using information coming from the initial syndrome value and its updates. In this work, we analyze a two-iterations parallel hard decision bit flipping decoder and propose concrete criteria for threshold determination, backed by a closed form model. In doing so, we introduce a new tightly fitting model for the distribution of the Hamming weight of the syndrome after the first decoder iteration and substantial improvements on the decoding failure rate (DFR) estimation with respect to existing approaches. |
|---|---|
| DOI: | 10.1109/ISIT63088.2025.11195438 |