{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T06:16:11Z","timestamp":1772864171700,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90166-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"197-207","source":"Crossref","is-referenced-by-count":39,"title":["The smallest length of binary 7\u2013dimensional linear codes with prescribed minimum distance"],"prefix":"10.1016","volume":"33","author":[{"given":"van Tilborg","family":"Henk C.A.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90166-7_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TIT.1976.1055518","article-title":"Binary codes with improved minimum weights","volume":"IT 22","author":"Alltop","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(81)90166-7_BIB2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TIT.1973.1054939","article-title":"A note on the Griesmer bound","volume":"IT 19","author":"Baumert","year":"1973","journal-title":"IEEE Trans. Inform. Theory."},{"key":"10.1016\/0012-365X(81)90166-7_BIB3","first-page":"100","article-title":"A conjecture on the Griesner bound, Optimization methods and their applications (All-Union Summer Sem. Khakusy, Lake Baikal 1972) (Russian)","volume":"182","author":"Belov","year":"1974"},{"key":"10.1016\/0012-365X(81)90166-7_BIB4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TIT.1970.1054452","article-title":"Computer results on the minimum distance of some binary cyclic codes","volume":"IT-16","author":"Chen","year":"1970","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(81)90166-7_BIB5","article-title":"An introduction to anticodes","author":"Farrell","year":"1978","journal-title":"CISM Summer School: Algebraic coding theory and applications"},{"key":"10.1016\/0012-365X(81)90166-7_BIB6","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","article-title":"A bound for error-correcting codes","volume":"4","author":"Griesmer","year":"1960","journal-title":"IBM J. Fes. Develop"},{"key":"10.1016\/0012-365X(81)90166-7_BIB7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TIT.1973.1055009","article-title":"Minimum distance bounds for binary linear codes","volume":"19","author":"Helgert","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(81)90166-7_BIB8","unstructured":"T. Helleseth and H.C.A.^van Tilborg, A new class of codes meeting the Griesmer bound, to appear."},{"key":"10.1016\/0012-365X(81)90166-7_BIB9","article-title":"The theory of Error correcting Codes","volume":"Vol. 16","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(81)90166-7_BIB10","series-title":"An improvement of the Griesmer bound in the case of small code distances, Optimization methods and their applications","first-page":"107","author":"Loga\u010dev","year":"1974"},{"key":"10.1016\/0012-365X(81)90166-7_BIB11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","article-title":"Algebraically punctures cyclic codes","volume":"8","author":"Solomon","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(81)90166-7_BIB12","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TIT.1978.1055929","article-title":"On quasi-cyclic codes with rate 1\/m","volume":"IT-24","author":"van Tilborg","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(81)90166-7_BIB13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","article-title":"On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound","volume":"44","author":"van Tilborg","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(81)90166-7_BIB14","unstructured":"H.C.A.^van Tilborg, a proof of the nonexistence of a binary (55, 7, 26) code, Technological University of Eindhoven, TH-Report 79-WSK-09."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81901667?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81901667?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:25:36Z","timestamp":1555140336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81901667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81901667"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90166-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}