{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:53Z","timestamp":1725664973527},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631637"},{"type":"electronic","value":"9783540691938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63163-1_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:09:58Z","timestamp":1330279798000},"page":"164-173","source":"Crossref","is-referenced-by-count":2,"title":["A brief tour of split linear programming"],"prefix":"10.1007","author":[{"given":"David B.","family":"Jaffe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"13_CR1","unstructured":"Bierbrauer, J. and Y. Edel: Construction of digital nets from BCH-codes, preprint."},{"key":"13_CR2","unstructured":"Bierbrauer, J. and Y. Edel: Parameters for binary codes, preprint, accessible over the World Wide Web via http:\/\/www.math.mtu.edu\/home\/math\/jbierbra\/Home.html, 1996."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/18.212302","volume":"39","author":"A. E. Brouwer","year":"1993","unstructured":"Brouwer, A. E.: The linear programming bound for binary linear codes, IEEE Trans. Inform. Theory\n39 (1993), 677\u2013680.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A. E. Brouwer","year":"1993","unstructured":"Brouwer, A. E. and T. Verhoeff: An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory\n39 (1993), 662\u2013677, supplemented by on-line updates: information regarding [n, k, d] codes with fixed n, k is accessible over the World Wide Web via http:\/\/www.win.tue.nl\/win\/math\/dw\/voorlincod.html and may also be obtained by sending electronic mail to laeb@cwi.nl with the subject lexec lincodbd and a message body consisting of the single line llincodbd 2 n k.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR5","first-page":"272","volume":"27","author":"P. Delsarte","year":"1972","unstructured":"Delsarte, P.: Bounds for unrestricted codes, by linear programming, Philips Res. Reports\n27 (1972), 272\u2013289.","journal-title":"Philips Res. Reports"},{"key":"13_CR6","volume-title":"Er bestaat geen binaire [33, 9, 13] code","author":"P. W. Heijnen","year":"1993","unstructured":"Heijnen, P. W.: Er bestaat geen binaire [33, 9, 13] code, Afstudeerverslag, T. U. Delft, 1993."},{"key":"13_CR7","unstructured":"Jaffe, D. B.: Binary linear codes: new results on nonexistence, preprint, accessible over the World Wide Web via http:\/\/www.math.unl.edu\/~djaffe\/codes\/code.ps.gz or code.dvi.gz."},{"key":"13_CR8","first-page":"151","volume":"6","author":"D. B. Jaffe","year":"1997","unstructured":"Jaffe, D. B. and D. Ruberman: A sextic surface cannot have 66 nodes, J. of Algebraic Geometry\n6 (1997), 151\u2013168.","journal-title":"J. of Algebraic Geometry"},{"key":"13_CR9","first-page":"41","volume":"43","author":"B. K. Kostova","year":"1990","unstructured":"Kostova, B. K. and N. L. Manev: A [25, 8, 10] code does not exist, C. R. Acad. Bulgare Sci.\n43 (1990), 41\u201344.","journal-title":"C. R. Acad. Bulgare Sci."},{"key":"13_CR10","unstructured":"Lawrence, K. M.: Construction of (t, m, s)-nets and orthogonal arrays from binary codes, preprint, 1996."},{"key":"13_CR11","unstructured":"Lawrence, K. M., A. Mahalanabis, G. L. Mullen and W. C. Schmid: Finite Fields and Applications: proceedings of the third international conference, Glasgow, July 1995, Cambridge Univ. Press, ed. S. Cohen, H. Niederreiter, 1996."},{"key":"13_CR12","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"MacWilliams, F. J. and N. J. A. Sloane: The Theory of Error-Correcting Codes, North-Holland (Amsterdam), 1977."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0024-3795(93)00106-A","volume":"216","author":"J. Simonis","year":"1995","unstructured":"Simonis, J.: MacWilliams identities and coordinate partitions, Linear Algebra Appl.\n216 (1995), 81\u201391.","journal-title":"Linear Algebra Appl."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","volume":"44","author":"H. Tilborg van","year":"1980","unstructured":"van Tilborg, H.: On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Inform. and Control\n44 (1980), 16\u201335.","journal-title":"Inform. and Control"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/18.54894","volume":"36","author":"\u00d8. Ytrehus","year":"1990","unstructured":"Ytrehus, \u00d8. and T. Helleseth: There is no binary [25, 8, 10] code, IEEE Trans. Inform. Theory\n36 (1990), 695\u2013696.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63163-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:42:12Z","timestamp":1619559732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63163-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631637","9783540691938"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63163-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}