@article {Yatribi2020226, title = {An Efficient and Secure Forward Error Correcting Scheme for DNA Data Storage}, journal = {Advances in Intelligent Systems and Computing}, volume = {942}, year = {2020}, note = {cited By 0}, pages = {226-237}, abstract = {In this paper, a new efficient error correcting scheme for DNA archival digital data storage is proposed. We devise a double protection scheme for DNA oligos, aiming to ensure the protection of both information and indexing header data from both symbol flipping and erasure-burst errors, using two different cyclic ternary difference-set codes, which are known to be completely orthogonalisable and very easy to decode using a simple majority-logic decoding algorithm. We show that the proposed scheme is efficient and easily scalable, and provides a coding potential of 1.97 bit per nucleotide, and a reasonable net information density of 0.75 bit/nt under the considered experimental conditions, with relatively a lower decoding complexity and costs compared to other DNA data storage approaches. {\textcopyright} 2020, Springer Nature Switzerland AG.}, keywords = {Bioinformatics, Decoding, Decoding complexity, Difference sets, Digital storage, DNA, Error correcting scheme, Errors, Experimental conditions, Forward error correcting, Gene encoding, Information density, Majority logic, Pattern recognition, Protection schemes, Simple majority, Soft computing}, doi = {10.1007/978-3-030-17065-3_23}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064931520\&doi=10.1007\%2f978-3-030-17065-3_23\&partnerID=40\&md5=215574899d2a75166c0a2fc343cb673e}, author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.} } @article {Yatribi2020, title = {Gradient-descent decoding of one-step majority-logic decodable codes}, journal = {Physical Communication}, volume = {39}, year = {2020}, note = {cited By 1}, abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. {\textcopyright} 2020 Elsevier B.V.}, keywords = {AWGN channel, Backpropagation, Computational complexity, Computer circuits, Decoding complexity, Difference sets, Economic and social effects, Electronic trading, Gradient descent, Gradient methods, Iterative decoding, LDPC codes, Majority logic, Majority logic decoding, Maximum likelihood, Maximum likelihood decoding, Optimization, OSMLD codes}, doi = {10.1016/j.phycom.2019.100999}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077749482\&doi=10.1016\%2fj.phycom.2019.100999\&partnerID=40\&md5=830156cfb12a8ec3dbff2e002b3ade63}, author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.} } @conference {Yatribi2017, title = {Non-binary cyclic majority-logic decodable codes: An algebraic construction by using Genetic Algorithms}, booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings}, year = {2017}, note = {cited By 0}, abstract = {In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from the dual domain and idempotents is investigated. This had led us to propose a new design algorithm based on Genetic Algorithms, as an extension to previous works on the binary field. With the proposed algorithm, we were able to obtain long new non-binary cyclic OSMLD codes with high coding rates and good correction capacities. In fact, two powerful properties of the algebraic construction are provided, firstly, the designed codes have their minimal distances dmin and dimensions calculated analyticaly, secondly, they can be decoded with a low-complexity majority-voting decoding scheme. {\textcopyright} 2016 IEEE.}, doi = {10.1109/ACOSIS.2016.7843935}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015215915\&doi=10.1109\%2fACOSIS.2016.7843935\&partnerID=40\&md5=4e462ad826ef141669b51bb0bf07198c}, author = {Yatribi, A. and Belkasmi, M. and Ayoub, F. and M{\textquoteright}rabet, Z.} }