By Topic

Genetic decoding of linear block codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cardoso, F.A.C.M. ; Dept. of Commun., UNICAMP, Sao Paulo, Brazil ; Arantes, D.S.

This paper investigates the application of genetic algorithms to the decoding problem of error-correcting codes. The basic operations of crossover, mutation and selection are appropriately defined for the decoding problem of binary linear block codes without the knowledge of any algebraic structure. Simulation results indicate that these evolutionary techniques, if properly applied, can provide very interesting results for this difficult combinatorial problem. The result were obtained for hard-decision decoding of binary linear block codes, but the algorithms can be generalized to soft-decision decoding and to other kinds of linear codes. The algorithms presented are in fact evolutionary versions of the well known information set decoding

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference:

1999