NAME

Algorithm::Evolutionary::Fitness::ECC - Error Correcting codes problem generator

SYNOPSIS

my $number_of_peaks = 100;
my $number_of_bits = 32;
my $p_peaks = Algorithm::Evolutionary::Fitness::P_Peaks->new( $number_of_peaks, $number_of_bits );

DESCRIPTION

Extracted from article "Effects of scale-free and small-world topologies on binary coded self-adaptive CEA", by Giacobini et al. Quoting: " The ECC problem was presented in [13]. We will consider a three-tuple (n, M, d), where n is the length of each codeword (number of bits), M is the number of codewords, and d is the minimum Hamming distance between any pair of codewords. Our objective will be to find a code which has a value for d as large as possible (reflecting greater tolerance to noise and errors), given previously fixed values for n and M . The problem we have studied is a simplified version of that in [13]. In our case we search half of the codewords (M/2) that will compose the code, and the other half is made up by the complement of the codewords computed by the algorithm"

[13] F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North- Holland, Amsterdam, 1977.

METHODS

new

Creates a new instance of the problem, with the said number of bits and peaks

_really_apply

Applies the instantiated problem to a chromosome

ecc

Applies the instantiated problem to a string

Copyright

This file is released under the GPL. See the LICENSE file included in this distribution,
or go to http://www.fsf.org/licenses/gpl.txt

CVS Info: $Date: 2009/02/06 16:03:04 $ 
$Header: /cvsroot/opeal/Algorithm-Evolutionary/lib/Algorithm/Evolutionary/Fitness/ECC.pm,v 2.3 2009/02/06 16:03:04 jmerelo Exp $ 
$Author: jmerelo $ 
$Revision: 2.3 $
$Name $