Iterative threshold decoding of Quasi-Cyclic One Step Majority logic decodable codes
Karim Rkizat, Mohammed Lahmer, Mostafa Belkasmi · 2015
This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented.