Performance of metropolis algorithm for the minimum weight code word problem

K. B. Ajitha Shenoy, Somenath Biswas, Piyush P. Kurur

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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; κ]-binary linear code. The algorithm uses the set Sκ of all κ × κ 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.

Original languageEnglish
Title of host publicationGECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference
PublisherAssociation for Computing Machinery (ACM)
Pages485-492
Number of pages8
ISBN (Print)9781450326629
DOIs
Publication statusPublished - 2014
Event16th Genetic and Evolutionary Computation Conference, GECCO 2014 - Vancouver, BC, Canada
Duration: 12-07-201416-07-2014

Conference

Conference16th Genetic and Evolutionary Computation Conference, GECCO 2014
CountryCanada
CityVancouver, BC
Period12-07-1416-07-14

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Ajitha Shenoy, K. B., Biswas, S., & Kurur, P. P. (2014). Performance of metropolis algorithm for the minimum weight code word problem. In GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference (pp. 485-492). Association for Computing Machinery (ACM). https://doi.org/10.1145/2576768.2598274