This a GA implementation using BInary and real coded variables. Mixed variables can be used. Constraints can also be handled. All constraints must be greater-than-equal-to type (g >= 0) and normalized (see the sample problem in prob1 in objective()).
We demonstrate a method for encoding and decoding the [24,12,8] extended BInary Golay code using a simple apparatus. We also present several generalizations of this construction which admit similar decoding algorithms.
convert.asm:
1.From ASCII resp. BCD to BInary
2.From BInary to ASCII resp. BCD
3.From BInary to Hex-ASCII
Bin_Bcd.c:
uchar BcdToBin(uchar val)
uchar BinToBcd(uchar val)
