{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:49:50Z","timestamp":1743050990288,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319172958"},{"type":"electronic","value":"9783319172965"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17296-5_27","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T14:30:01Z","timestamp":1437748201000},"page":"255-262","source":"Crossref","is-referenced-by-count":2,"title":["An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm"],"prefix":"10.1007","author":[{"given":"Petr","family":"Lison\u011bk","sequence":"first","affiliation":[]},{"given":"Layla","family":"Trummer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Codierungstheorie\u2013Konstruktion und Anwendung Linearer Codes","author":"A. Betten","year":"1998","unstructured":"Betten, A., Fripertinger, H., Kerber, A., Wassermann, A., Zimmermann, K.-H.: Codierungstheorie\u2013Konstruktion und Anwendung Linearer Codes. Springer, Berlin (1998)"},{"key":"27_CR2","volume-title":"Error-Correcting Linear Codes","author":"A. Betten","year":"2006","unstructured":"Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes. Springer, Berlin\/New York (2006)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"I. The user language. J. Symb. Comput."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"W.H. Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15, 948\u2013957 (1986)","journal-title":"SIAM J. Comput."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B 69B, 67\u201372 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-37634-7_13","volume-title":"Discovering Mathematics with Magma \u2013 Reducing the Abstract to the Concrete","author":"M. Grassl","year":"2006","unstructured":"Grassl, M.: Searching for linear codes with large minimum distance. In: Bosma, W., Cannon, J. (eds.) Discovering Mathematics with Magma \u2013 Reducing the Abstract to the Concrete, pp. 287\u2013313. Springer, Berlin\/New York (2006)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"4870","DOI":"10.1109\/TIT.2012.2191389","volume":"58","author":"M. Kiermaier","year":"2012","unstructured":"Kiermaier, M., Wassermann, A.: Minimum weights and weight enumerators of \n$$\\mathbb{Z}_{4}$$\n-linear quadratic residue codes. IEEE Trans. Inf. Theory 58, 4870\u20134883 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"27_CR9","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam\/New York (1977)"},{"key":"27_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J. Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory, 2nd edn. Oxford University Press, Oxford\/New York (2011)","edition":"2"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43, 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["CIM Series in Mathematical Sciences","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17296-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T22:04:22Z","timestamp":1674252262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17296-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319172958","9783319172965"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17296-5_27","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"type":"print","value":"2364-950X"},{"type":"electronic","value":"2364-9518"}],"subject":[],"published":{"date-parts":[[2015]]}}}