Maximally Distant Codes Allocation Using Chemical Reaction Optimization with Enhanced Exploration

Error correcting codes, also known as error controlling codes, are sets of codes with redundancy that provides for error detection and correction, for fault tolerant operations like data transmission over noisy channels or data retention using storage media with possible physical defects. The challenge is to find a set of m codes out of 2n available n-bit combinations, such that the aggregate hamming distance among those codewords and/or the minimum distance is maximized. Due to the prohibitively large solution spaces of practically sized problems, greedy algorithms are used to generate quick and dirty solutions. However, modern evolutionary search techniques like genetic algorithms, swarm particles, gravitational search, and others, offer more feasible solutions, yielding near optimal solutions in exchange for some computational time. The Chemical Reaction Optimization (CRO), which is inspired by the molecular reactions towards a minimal energy state, emerged recently as an efficient optimization technique. However, like the other techniques, its internal dynamics are hard to control towards convergence, yielding poor performance in many situations. In this research, we proposed an enhanced exploration strategy to overcome this problem, and compared it with the standard threshold based exploration strategy in solving the maximally distant codes allocation problem. Test results showed that the enhancement provided better performance on most metrics.

@article{Eldos2016,
  title     = {Maximally Distant Codes Allocation Using Chemical Reaction Optimization with Enhanced Exploration},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {1},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Taisir Eldos and Abdallah Khreishah},
  doi       = {10.14569/IJACSA.2016.070133},
  url       = {https://doi.org/10.14569/IJACSA.2016.070133}
}