{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:45:36Z","timestamp":1773081936783,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icmcs.2012.6320261","type":"proceedings-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T17:01:35Z","timestamp":1368637295000},"page":"318-324","source":"Crossref","is-referenced-by-count":7,"title":["An efficient method to find the minimum distance of linear block codes"],"prefix":"10.1109","author":[{"given":"Mohamed","family":"Askali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said","family":"Nouh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Belkasmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","author":"pless","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.5958\/j.0975-8070.2.3.022"},{"key":"13","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"0","journal-title":"Proc IEEE Int'l Conf on Commun Paris France Jun 2004"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCS.2006.301431"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1590\/S0101-82052005000300004"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.817527"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.746813"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.746813"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056861"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2011.5945582"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"},{"key":"6","article-title":"A comparative Stusy of Search Techniques Applied to the minumum Distance of BCH Codes","author":"wallis","year":"0","journal-title":"Conference on Artificial Intelligence and Soft Computing 5ASC 2002 Banff July 2002"},{"key":"5","article-title":"On the minimum weights of binary extended quadratic residue codes","volume":"3","author":"su","year":"0","journal-title":"ICACT'09 Proceedings of the 11th International Conference on Advanced Communication Technology"},{"key":"4","article-title":"On the Minimum Distance of some Quadratic Residue Codes","author":"grassl","year":"2000","journal-title":"Proc IEEE Int'l Symp on Inform Theory(ISIT) Sorrento Italy June"},{"key":"9","author":"grassl","year":"0","journal-title":"IAKS"},{"key":"8","author":"mcwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"}],"event":{"name":"2012 International Conference on Multimedia Computing and Systems (ICMCS)","location":"Tangiers, Morocco","start":{"date-parts":[[2012,5,10]]},"end":{"date-parts":[[2012,5,12]]}},"container-title":["2012 International Conference on Multimedia Computing and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6308061\/6320104\/06320261.pdf?arnumber=6320261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T18:55:54Z","timestamp":1490122554000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6320261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icmcs.2012.6320261","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}