Maximally Distant Codes Allocation Using Chemical Reaction Optimization with Enhanced Exploration
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 1
Abstract
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.
Authors and Affiliations
Taisir Eldos, Abdallah Khreishah
Application of the Scattering Bond Graph Methodology for Composite Right/Left Handed Transmission Lines
The approach of the metamaterials based on the theory of transmission lines has an influence on the development of the radiofrequency domain, so the types and techniques of elaboration of these artificial lines are quite...
Lempel - Ziv Implementation for a Compression System Model with Sliding Window Buffer
Proposed compression system architecture based on Lempel-Ziv algorithm with sliding window history buffer, this architecture may be realized on FPGA, and can provide input data streams from multiple sources and context s...
Web Server Performance Evaluation in a Virtualisation Environment
Operational and investment costs are reduced by resource sharing in virtual machine (VM) environments, which also results in an overhead for hosted services. VM machine performance is important because of resource conten...
Testing and Analysis of Activities of Daily Living Data with Machine Learning Algorithms
It is estimated that 28% of European Union’s population will be aged 65 or older by 2060. Europe is getting older and this has a high impact on the estimated cost to be spent for older people. This is because, compared t...
Statistical Analysis and Security Evaluation of Chaotic RC5-CBC Symmetric Key Block Cipher Algorithm
In some previous research works, it has been theoretically proven that RC5-CBC encryption algorithm behaves as a Devaney topological chaos dynamical system. This unpre-dictable behavior has been experimentally illustrate...