Design of good linear codes for a decoder based on majority voting procedure

In this paper we present a genetic algorithm to design good linear codes with large minimum weight and small dual minimum distance. These two metrics are evaluated by the Multiple Impulse Method (MIM). The existence of some codewords of small weights in the dual of the code designed by our genetic a...

Full description

Saved in:
Bibliographic Details
Published in2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS) pp. 1 - 6
Main Authors Joundan, Issam Abderrahman, Nouh, Said, Namir, Abdelwahed
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2016
Subjects
Artificial reliabilities based decoding algorithm
Circulant matrix
Decoding
Error correction codes
Genetic algorithms
Linear codes
Linear Error Correcting codes
Minimum Distance
Multiple Impulse Method
Reliability
Sociology
Statistics
Online AccessGet full text

Cover

More Information
Summary:In this paper we present a genetic algorithm to design good linear codes with large minimum weight and small dual minimum distance. These two metrics are evaluated by the Multiple Impulse Method (MIM). The existence of some codewords of small weights in the dual of the code designed by our genetic algorithm yield to good performances in terms of the Bit Error Rate (BER) when a decoder based on majority voting procedure is applied. The comparison between performances of the proposed algorithm and other coder/decoder schemes on AWGN (Additive White Gaussian Noise) channel proves its capacity in correcting errors.
DOI:10.1109/ACOSIS.2016.7843918