Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms

DOI10.1155/2012/609650MaRDI QIDQ693830zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Abdeslam Ahmadi, Faissal El Bouanani, Hussain Ben-Azza, Youssef Benghabrit

Publication date 11 December 2012

Published in Journal of Electrical and Computer Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/609650

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Efficient dual domain decoding of linear block codes using genetic algorithms
• Near-optimum decoding of product codes: Block turbo codes
• Iterative decoding of binary block and convolutional codes
• scientific article; zbMATH DE number 2077096
• Improved BP-based decoding algorithms integrated with GA for LDPC codes

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 6433928 (Why is no real title available?)
• A recursive approach to low complexity codes
• Class of algorithms for decoding block codes with channel measurement information
• Good codes based on very sparse matrices

Cited in

(3)

• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• Efficient dual domain decoding of linear block codes using genetic algorithms
• Improved multiuser detectors employing genetic algorithms in a space-time block coded system

This page was built for publication: Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693830)