Self-organizing Coalitions for Managing Complexity by Juan C. Burguillo

Author:Juan C. Burguillo
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

(8.3)

8.6.3 Error Correcting Code Design Problem (ECC)

The ECC problem was presented in [48]. 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 [48]. In our case we search for 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.

The fitness function to be maximized is:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.