@conference {Addi2017,
	title = {New hard decision decoder of LDPC codes using single bit flipping algorithm},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity- Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping algorithm, the proposed algorithm employs criteria of flipping single bit chosen carefully. This method eliminates the risk for flipping more than one bit at a time that can induce additional error bits and propagate the errors to the later iterations. We present some results obtained by applying this new method that provides a gain in performance in comparison to the standard Gallager Bit-Flipping with low complexity. {\textcopyright}2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238191},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041431498\&doi=10.1109\%2fWINCOM.2017.8238191\&partnerID=40\&md5=51139715da4295938142bee17d106a96},
	author = {Addi, S. and Berkani, A. and Azouaoui, A. and Belkasmi, M.}
}
@conference {Berkani2017,
	title = {A reduced complexity decoder using compact genetic algorithm for linear block codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The compact Genetic Algorithm decoder has been introduced in [9] as an efficient decoding method of linear block codes. It requires less storage memory than Genetic Algorithms based decoders. One of its major weakness is the big number of necessary iterations to reach convergence in comparison with Genetic Algorithms (GA) based decoders. We propose, in this work, new ideas allowing us to reduce the number of iterations from about 105 to just about 103 which reduces the complexity of decoding. This, without decreasing the decoding performance. We introduce a new stopping criterion based on the soft weight of the probability vector p, a new initialization method of p and we tried to combine both methods all together. Both performance study and the calculation of the average number of iterations ensure the effectiveness of the proposed decoder. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843925},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015167666\&doi=10.1109\%2fACOSIS.2016.7843925\&partnerID=40\&md5=5a7c05dbd39172dd4eae18956ce8e95e},
	author = {Berkani, A. and Belkasmi, M.}
}
