{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:18:38Z","timestamp":1775053118771,"version":"3.50.1"},"reference-count":2,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365491","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"454-454","source":"Crossref","is-referenced-by-count":8,"title":["New good linear codes by special puncturings"],"prefix":"10.1109","author":[{"given":"M.","family":"Grassl","sequence":"first","affiliation":[]},{"given":"G.","family":"White","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref2","first-page":"295","article-title":"Bounds on the Size of Linear Codes","author":"brouwer","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365491.pdf?arnumber=1365491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T03:18:49Z","timestamp":1489461529000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365491\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":2,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365491","relation":{},"subject":[]}}