A tabu search approach to the minimum distance of error-correcting codes

Bland, J. A.; Baylis, D. J.

doi:10.1080/00207219508926317

Cited by 12 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other columns in the Table 1 give the performance of the previously studied algorithms. Based on the result, it can be seen that our Metropolis algorithm outperforms hill climbing, tabu search, Wallis's genetic algorithm and ant colony optimization [4,13,8,5,7] in all the twenty cases considered. When compared to the Askali's genetic algorithm [5,4] on the twenty test cases, the performance was same in 9 cases, the genetic algorithm outperforms our algorithm in 4 test cases and our algorithm outperforms the genetic algorithm in 7 test cases.…”

Section: Resultsmentioning

confidence: 85%

“…With α set to 1, we tested our algorithm on the set of 20 test cases given in six previous publications [4,13,8,5,7,24]. The heuristic search algorithms used in these publications are Wallis's GA [4,13], Askali's GA [4,5], Tabu-search [4,13,8,5], Hill Climbing [4,13,5], Ant colony optimization [7] and simulated annealing [7,24]. Each of these heuristics use the same set, namely, the set of all length k binary words, as their search space.…”

Section: Resultsmentioning

confidence: 99%

“…It is for this reason that researchers have proposed several probabilistic and heuristic algorithms to find low weight code words, given a basis of a binary linear code. Examples are: GA [4,13,5], hill climbing [4,13,5], tabu search [8], and ACO [7].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Performance of metropolis algorithm for the minimum weight code word problem

Shenoy

Biswas

Kurur

2014

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

We study the performance of the Metropolis algorithm for the problem of finding a code word of weight less than or equal to M , given a generator matrix of an [n, k]-binary linear code. The algorithm uses the set S k of all k × k invertible matrices as its search space where two elements are considered adjacent if one can be obtained from the other via an elementary row operation (i.e by adding one row to another or by swapping two rows.) We prove that the Markov chains associated with the Metropolis algorithm mix rapidly for suitable choices of the temperature parameter T . We ran the Metropolis algorithm for a number of codes and found that the algorithm performed very well in comparison to previously known experimental results.

show abstract

Section: Resultsmentioning

confidence: 85%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Performance of metropolis algorithm for the minimum weight code word problem

Shenoy

Biswas

Kurur

2014

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…In order to validate the proposed method, it is applied on all QR codes of known minimum distance presented in [14][15][16][17][18][19][20][21]. The TABLE I summarizes the obtained results, it shows that the minimum weight found by the Zimmermann-FSI method is equal to the true value of the minimum distance of all QR codes of known minimum distance.…”

Section: Validation Of Zimmermann-fsi Methodmentioning

confidence: 99%

“…When the dimension k increases, the size of the search space becomes prohibitively large and exhaustive search becomes not feasible. In [14][15][16][17][18][19][20][21] authors have used many techniques to find the true value of the minimum distances of QR codes for all lengths less than or equal to 223. For more lengths, this metric is still unknown.…”

Section: Related Workmentioning

confidence: 99%