{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:30Z","timestamp":1772283690132,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540541950","type":"print"},{"value":"9783540474890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54195-0_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:36:21Z","timestamp":1330191381000},"page":"24-35","source":"Crossref","is-referenced-by-count":3,"title":["A description of the [16,7,6] codes"],"prefix":"10.1007","author":[{"given":"Juriaan","family":"Simonis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"3_CR1","volume-title":"Design Theory","author":"T. Beth","year":"1985","unstructured":"Th. Beth, D. Jungnickel and H. Lenz, Design Theory (B.I.-Wissenschaftsverlag, Mannheim, 1985)."},{"key":"3_CR2","unstructured":"B.K. Kostova and N.L. Manev, A [25,8,10] code does not exist, preprint."},{"key":"3_CR3","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1983","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, New York, 1983)."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","volume":"44","author":"H. Tilborg van","year":"1980","unstructured":"H. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Information and Control 44 (1980), 16\u201335.","journal-title":"Information and Control"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(81)90166-7","volume":"33","author":"H. Tilborg van","year":"1981","unstructured":"H. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance., Discrete Mathematics 33 (1981), 197\u2013207.","journal-title":"Discrete Mathematics"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1987.1057356","volume":"33","author":"T. Verhoeff","year":"1987","unstructured":"T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Transactions on Information Theory 33 (1987) 665\u2013680.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/18.54894","volume":"36","author":"\u00d8. Ytrehus","year":"1990","unstructured":"\u00d8. Ytrehus and T. Helleseth, There is no binary [25,8,10] code, IEEE Transactions on Information Theory 36 (1990) 695\u2013696.","journal-title":"IEEE Transactions on Information 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-54195-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:12Z","timestamp":1619558412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54195-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541950","9783540474890"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-54195-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}