{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T17:04:34Z","timestamp":1748019874067},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0166-218x(93)90127-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"219-226","source":"Crossref","is-referenced-by-count":12,"title":["A new class of nonbinary codes meeting the Griesmer bound"],"prefix":"10.1016","volume":"47","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[]},{"given":"\u00d8yvind","family":"Ytrehus","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90127-A_BIB1","series-title":"Optimization Methods and Their Applications","first-page":"100","article-title":"A conjecture on the Griesmer bound","volume":"182","author":"Belov","year":"1972-1974"},{"key":"10.1016\/0166-218X(93)90127-A_BIB2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1049\/el:19700293","article-title":"Linear binary anticodes","volume":"6","author":"Farrell","year":"1970","journal-title":"Electron. Lett."},{"key":"10.1016\/0166-218X(93)90127-A_BIB3","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. Res. Develop."},{"key":"10.1016\/0166-218X(93)90127-A_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(93)90404-H","article-title":"A characterization of some [n, k, d; q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry","volume":"116","author":"Hamada","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90127-A_BIB5","first-page":"231","article-title":"A characterization of some linear codes over GF(4) meeting the Griesmer bound","volume":"37","author":"Hamada","year":"1992","journal-title":"Math. Japon."},{"key":"10.1016\/0166-218X(93)90127-A_BIB6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","article-title":"A characterization of codes meeting the Griesmer bound","volume":"50","author":"Helleseth","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(93)90127-A_BIB7","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TIT.1983.1056658","article-title":"New constructions of codes meeting the Griesmer bound","volume":"29","author":"Helleseth","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)90127-A_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(77)90078-4","article-title":"The weight distribution of irreducible cyclic codes with block lengths n1((ql \u2212 1)\/N)","volume":"18","author":"Helleseth","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90127-A_BIB9","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1109\/TIT.1981.1056405","article-title":"A new class of codes meeting the Griesmer bound","volume":"27","author":"Helleseth","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)90127-A_BIB10","series-title":"Modeling and Optimization in Large Power Systems","first-page":"116","article-title":"Construction of a class of codes that meet the Varshamov-Griesmer bound","author":"Logachev","year":"1975"},{"key":"10.1016\/0166-218X(93)90127-A_BIB11","series-title":"Proceedings Eight All-Union Conference on Coding Theory and Information Transmission, Part 2: Abstracts of Reports","first-page":"95","article-title":"Construction of a class of optimal anticodes","author":"Logachev","year":"1981"},{"key":"10.1016\/0166-218X(93)90127-A_BIB12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","article-title":"Algebraically punctured cyclic codes","volume":"8","author":"Solomon","year":"1965","journal-title":"Inform. and Control"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390127A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390127A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:32Z","timestamp":1555136792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390127A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0166218X9390127A"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90127-a","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}