{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:45Z","timestamp":1750308705090,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598274","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"485-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Performance of metropolis algorithm for the minimum weight code word problem"],"prefix":"10.1145","author":[{"given":"Ajitha","family":"Shenoy K B","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Kanpur, India"}]},{"given":"Somenath","family":"Biswas","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kanpur, India"}]},{"given":"Piyush P.","family":"Kurur","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kanpur, India"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Journal of Engineering Science and Technology (IJEST), 5(2):359--364","author":"Ahmed D.","year":"2013","unstructured":"D. Ahmed and A. Asimi . A pseudo random generator efficient based on the decoding of the rational binary goppa code . International Journal of Engineering Science and Technology (IJEST), 5(2):359--364 , 2013 . D. Ahmed and A. Asimi. A pseudo random generator efficient based on the decoding of the rational binary goppa code. International Journal of Engineering Science and Technology (IJEST), 5(2):359--364, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIS.2011.6122146"},{"key":"e_1_3_2_1_3_1","first-page":"317","article-title":"Search graph formulation and hasting's generalization of metropolis algorithm for solving svp","volume":"5","author":"Ajitha Shenoy K. B.","year":"2013","unstructured":"K. B. Ajitha Shenoy , S. Biswas , and P. P. Kurur . Search graph formulation and hasting's generalization of metropolis algorithm for solving svp . International Journal of Computer Information Systems and Industrial Management Applications , 5 : 317 -- 325 , 2013 . K. B. Ajitha Shenoy, S. Biswas, and P. P. Kurur. Search graph formulation and hasting's generalization of metropolis algorithm for solving svp. International Journal of Computer Information Systems and Industrial Management Applications, 5:317--325, 2013.","journal-title":"International Journal of Computer Information Systems and Industrial Management Applications"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4236\/ijcns.2012.511081"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2012.6320261"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2007.01.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207219508926317"},{"key":"e_1_3_2_1_9_1","volume-title":"Information Theory Coding and Cryptography","author":"Bose R.","year":"2008","unstructured":"R. Bose . Information Theory Coding and Cryptography . McGraw-Hill , New Delhi , India, 2008 . R. Bose. Information Theory Coding and Cryptography. McGraw-Hill, New Delhi, India, 2008."},{"key":"e_1_3_2_1_10_1","first-page":"475","volume-title":"40th Annual Symposium on","author":"Dumer I.","year":"1999","unstructured":"I. Dumer , D. Micciancio , and M. Sudan . Hardness of approximating the minimum distance of a linear code. In Foundations of Computer Science (FOCS) , 40th Annual Symposium on , pages 475 -- 484 , October 1999 . I. Dumer, D. Micciancio, and M. Sudan. Hardness of approximating the minimum distance of a linear code. In Foundations of Computer Science (FOCS), 40th Annual Symposium on, pages 475--484, October 1999."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754526"},{"key":"e_1_3_2_1_12_1","volume-title":"Handbook of Linear Algebra. Champman and Hall\/CRC","author":"Hogben L.","year":"2007","unstructured":"L. Hogben . Handbook of Linear Algebra. Champman and Hall\/CRC , Taylor and Francis Group , USA , 2007 . L. Hogben. Handbook of Linear Algebra. Champman and Hall\/CRC, Taylor and Francis Group, USA, 2007."},{"key":"e_1_3_2_1_13_1","first-page":"164","volume-title":"In proceedings of sixth IASTED International Conference on Artificial Intelligence and Soft Computing","author":"Houghten S. K.","year":"2002","unstructured":"S. K. Houghten and J. L. Wallis . A comparative study of search techniques applied to the minimum distance problem of bch codes . In In proceedings of sixth IASTED International Conference on Artificial Intelligence and Soft Computing , pages 164 -- 169 . Brock University , May 2002 . S. K. Houghten and J. L. Wallis. A comparative study of search techniques applied to the minimum distance problem of bch codes. In In proceedings of sixth IASTED International Conference on Artificial Intelligence and Soft Computing, pages 164--169. Brock University, May 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting Codes","author":"Huffman W. C.","year":"2003","unstructured":"W. C. Huffman and V. Pless . Fundamentals of Error Correcting Codes . Cambridge University Press , Cambridge, United Kingdom, 2003 . W. C. Huffman and V. Pless. Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge, United Kingdom, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.029"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283978"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the fourth IMA conference on Cryptography and Coding","author":"Massey J. L.","year":"1993","unstructured":"J. L. Massey . Some applications of coding theory in cryptography . In Proceedings of the fourth IMA conference on Cryptography and Coding , Cirencester, England , 1993 . J. L. Massey. Some applications of coding theory in cryptography. In Proceedings of the fourth IMA conference on Cryptography and Coding, Cirencester, England, 1993."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/9781118032749","volume-title":"Bose Chaudhuri Hocquenghem (bch) codes. Introduction to the Theory of Error-Correcting Codes","author":"Pless V.","year":"1998","unstructured":"V. Pless . Bose Chaudhuri Hocquenghem (bch) codes. Introduction to the Theory of Error-Correcting Codes , Third Edition, pages 109 -- 122 , 1998 . V. Pless. Bose Chaudhuri Hocquenghem (bch) codes. Introduction to the Theory of Error-Correcting Codes, Third Edition, pages 109--122, 1998."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830744"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000390"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"A. Sinclair. Algorithms for Ranodom Generation and Counting - A Markov Chain Approach. Birkhauser Boston Cambridge MA 02139 U.S.A. 1993. A. Sinclair. Algorithms for Ranodom Generation and Counting - A Markov Chain Approach. Birkhauser Boston Cambridge MA 02139 U.S.A. 1993.","DOI":"10.1007\/978-1-4612-0323-0"},{"issue":"3","key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/00207219408925934","article-title":"Simulated annealing approach to the minimum distance of error correcting codes","volume":"76","author":"Zhang M.","year":"1994","unstructured":"M. Zhang and F. Ma . Simulated annealing approach to the minimum distance of error correcting codes . Internation Journal of Electronics , 76 ( 3 ): 377 -- 384 , 1994 . M. Zhang and F. Ma. Simulated annealing approach to the minimum distance of error correcting codes. Internation Journal of Electronics, 76(3):377--384, 1994.","journal-title":"Internation Journal of Electronics"}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Vancouver BC Canada","acronym":"GECCO '14"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:00Z","timestamp":1750277640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":24,"alternative-id":["10.1145\/2576768.2598274","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598274","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}