{'fraction_non_alphanumeric': 0.019138755980861243, 'fraction_numerical': 0.0, 'mean_word_length': 5.340909090909091, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
New ant colony optimization for searching the minimum distance for linear codes

In coding theory, finding minimum distance remains one of the most open problems, actually it was proven to be an NP-hard type. Therefore classical algorithms become impracticable for large codes. Metaheuristic approaches come out to tackle this kind of problems by producing “good” solutions but eventually not the best at reasonable computational cost. In this paper we will attack this problem using Ant Colony Optimization (ACO), one of the successful swarm intelligence metaheuristic methods, derived from nature, especially the collective behavior of ants to find the best path to food, our implementation tested on linear codes then compared with previous works. The obtained results show an improvement in solution accuracy and computational cost.