Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces

This article studies the efficacy of the Metropolis algorithm for the <italic>minimum-weight codeword problem</italic>. The input is a linear code <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula> given by its generator matrix and our task is to compute a nonzero codeword in the code <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula> of least weight. In particular, we study the Metropolis algorithm on two possible search spaces for the problem: 1) the <italic>codeword space</italic> and 2) the <italic>generator space</italic>. The former is the space of all codewords of the input code and is the most natural one to use and hence has been used in previous work on this problem. The latter is the space of all generator matrices of the input code and is studied for the first time in this article. In this article, we show that for an appropriately chosen temperature parameter the Metropolis algorithm mixes rapidly when either of the search spaces mentioned above are used. Experimentally, we demonstrate that the Metropolis algorithm performs favorably when compared to previous attempts. When using the generator space, the Metropolis algorithm is able to outperform the previous algorithms in most of the cases. We have also provided both theoretical and experimental justification to show why the generator space is a worthwhile search space to use for this problem.

[1]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[2]  J. A. Bland,et al.  A tabu search approach to the minimum distance of error-correcting codes , 1995 .

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  Zhihui Li,et al.  Secret sharing schemes from binary linear codes , 2010, Inf. Sci..

[5]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[6]  Ahmed Azouaoui,et al.  On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods , 2012, ArXiv.

[7]  Ingo Wegener.  Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems , 2008 .

[8]  L. Hogben.  Handbook of Linear Algebra , 2006 .

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[11]  Jacques Stern,et al.  An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding , 1996, EUROCRYPT.

[12]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[13]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[16]  Ranjan Bose,et al.  Information theory, coding and cryptography , 2003 .

[17]  J. A. Bland.  Local search optimisation applied to the minimum distance problem , 2007, Adv. Eng. Informatics.

[18]  L. Goddard.  Information Theory , 1962, Nature.

[19]  Madhu Sudan,et al.  Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.

[20]  M. Belkasmi,et al.  An efficient method to find the minimum distance of linear block codes , 2012, 2012 International Conference on Multimedia Computing and Systems.

[21]  JM Jeroen Doumen,et al.  Some applications of coding theory in cryptography , 2003 .

[22]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[23]  Ahmed Asimi,et al.  A PSEUDO-RANDOM GENERATOR EFFICIENT BASED ON THE DECODING OF THE RATIONAL BINARY GOPPA CODE , 2013 .

[24]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[25]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[26]  Xin-Wen Wu,et al.  On a class of three-weight codes with cryptographic applications , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[27]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[28]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[29]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[30]  Somenath Biswas,et al.  Performance of metropolis algorithm for the minimum weight code word problem , 2014, GECCO.

[31]  Sheridan Houghten,et al.  A COMPARATIVE STUDY OF SEARCH TECHNIQUES APPLIED TO THE MINIMUM DISTANCE PROBLEM OF BCH CODES , 2002 .