{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:09:22Z","timestamp":1762250962986,"version":"3.41.2"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,5]]},"DOI":"10.1109\/tit.1983.1056658","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"434-439","source":"Crossref","is-referenced-by-count":19,"title":["New constructions of codes meeting the Griesmer bound"],"prefix":"10.1109","volume":"29","author":[{"given":"T.","family":"Helleseth","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90115-1"},{"key":"ref3","first-page":"100","author":"belov","year":"1974","journal-title":"A conjecture on the Griesmer bound \" in Optimization Methods and Their Applications"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056405"},{"key":"ref11","first-page":"211","article-title":"Construction of a class of linear binary codes achieving the Varshamov-Griesmer bound","volume":"10","author":"belov","year":"1974","journal-title":"Probl Inform Transm"},{"journal-title":"The classification of all (145 7 72) binary linear codes","year":"1980","author":"helleseth","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1049\/el:19700293"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(81)90184-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"journal-title":"Algebraic Coding Theory and Applications","year":"1979","author":"farrell","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22732\/01056658.pdf?arnumber=1056658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:36Z","timestamp":1753121256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,5]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056658","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,5]]}}}