{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:06:17Z","timestamp":1742961977279,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223436"},{"type":"electronic","value":"9783540248552"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24855-2_137","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T08:20:59Z","timestamp":1284452459000},"page":"1301-1302","source":"Crossref","is-referenced-by-count":2,"title":["A Genetic Approach for Generating Good Linear Block Error-Correcting Codes"],"prefix":"10.1007","author":[{"given":"Alan","family":"Barbieri","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Cagnoni","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Colavolpe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"137_CR1","doi-asserted-by":"crossref","unstructured":"Dontas, K., Jong, K.D.: Discovery of maximal distance codes using genetic algorithms. In: Proceedings of the 2nd International IEEE Conference on tools for Artificial Intelligence, pp. 805\u2013811 (1990)","DOI":"10.1109\/TAI.1990.130442"},{"key":"137_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A.E. Brouwer","year":"1993","unstructured":"Brouwer, A.E., Verhoeff, T.: An updated table of minimum-distance bounds for binary linear codes. IEEE Transactions on Information Theory\u00a039, 662\u2013677 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"137_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I. Dumer","year":"2003","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Transactions on Information Theory\u00a049, 22\u201337 (2003)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24855-2_137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:09:34Z","timestamp":1740514174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24855-2_137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223436","9783540248552"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24855-2_137","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}