Performance of Metropolis Algorithm for the Minimum Weight Code Word Problem

Shenoy, Ajitha K B and Biswas, Somenath and Kurur, Piyush P (2016) Performance of Metropolis Algorithm for the Minimum Weight Code Word Problem. In: GECCO’14, July 12–16, 2014, Vancouver, BC, Canada.

[img] PDF
584.pdf - Published Version
Restricted to Registered users only

Download (567kB) | Request a copy

Abstract

We study the performance of the Metropolis algorithm for the problem of �nding 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 Sk of all k � k in- vertible matrices as its search space where two elements are considered adjacent if one can be obtained from the other an elementary row operation (i.e by adding one row to an- other 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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Metropolis Algorithm; Minimum weight code word; search space; conductance; rapid mixing
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 12 Jan 2017 13:17
Last Modified: 12 Jan 2017 13:17
URI: http://eprints.manipal.edu/id/eprint/148045

Actions (login required)

View Item View Item