Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Communication

Gradient-descent decoding of one-step majority-logic decodable codes

Anouar Yatribi, Mostafa Belkasmi, Fouad Ayoub

Published Jan 10, 2020• 6 citations
Publisher
DOI
10.1016/j.phycom.2019.100999

Related papers

Iterative Gradient Descent Decoding for Real Number LDPC Codes

Alexandru Amaricăi, Oana Boncalo

•Jan 1, 2026•0 citations

Early Stopping for Noisy Gradient Descent Bit Flipping Decoding of LDPC Codes

Li Guo Zhang, Nan Liu, Zhiwen Pan +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2021•0 citations

Modified Gradient Descent Bit-Flipping Decoding for Low-Density Parity-Check Codes

Hua Li, Hong Wei Ding, Linhua Zheng

Wireless Personal Communications•May 25, 2017•3 citations

Stochastic resonance in iterative decoding: Message passing and gradient descent bit flipping

Predrag Ivaniš, Srdan S. Brkic, Bane V. Vasic

This paper contains a survey on iterative decoders of low-density parity-check (LDPC) codes made of unreliable logic gates that are capable to provide lower probability of error, when compared to their perfectly reliable counterparts. We have recently shown that the error-floor performance of message-passing decoders can be improved, if randomness that exists in unreliable logic gates is incorporated into decoding deliberately, without any complexity cost. Furthermore, we have shown that controlling the level of unreliability enable us to exploit the stochastic resonance phenomenon, previously observed in theoretical physics, electronic and magnetic systems. In contrary to common belief, we have shown that for a narrow range of gate failure probability the overall decoding performance is dramatically increased. In this paper, we show that the effect of stochastic resonance is even more noticeable for the case of the gradient descent bit-flipping (GDBF) algorithm. This decoder combines the simplest iterative decoding algorithm with gradient descent optimization, making it an attractive solution for a variety of low complexity storage systems, or code-based cryptosystems. In addition, we show that getting the most of the stochastic resonance is essentially a deep learning problem, since setting the levels of unreliability for individual parts of the decoder by a training process is a step toward incorporating the machine learning techniques into design and analysis of iterative decoders of LDPC codes.

International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)•Oct 1, 2017•1 citation

Majority Logic Decoding for Linear Codes

Paul D. Laity

•Jan 1, 1973•0 citations

Majority-logic decoding of binary block codes

Nguyen Quang Đuc

•Jan 1, 1972•0 citations
This paper contains a survey on iterative decoders of low-density parity-check (LDPC) codes made of unreliable logic gates that are capable to provide lower probability of error, when compared to their perfectly reliable counterparts. We have recently shown that the error-floor performance of message-passing decoders can be improved, if randomness that exists in unreliable logic gates is incorporated into decoding deliberately, without any complexity cost. Furthermore, we have shown that controlling the level of unreliability enable us to exploit the stochastic resonance phenomenon, previously observed in theoretical physics, electronic and magnetic systems. In contrary to common belief, we have shown that for a narrow range of gate failure probability the overall decoding performance is dramatically increased. In this paper, we show that the effect of stochastic resonance is even more noticeable for the case of the gradient descent bit-flipping (GDBF) algorithm. This decoder combines the simplest iterative decoding algorithm with gradient descent optimization, making it an attractive solution for a variety of low complexity storage systems, or code-based cryptosystems. In addition, we show that getting the most of the stochastic resonance is essentially a deep learning problem, since setting the levels of unreliability for individual parts of the decoder by a training process is a step toward incorporating the machine learning techniques into design and analysis of iterative decoders of LDPC codes.