{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:26Z","timestamp":1773376646647,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206543","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"844-849","source":"Crossref","is-referenced-by-count":1,"title":["A Generalized Covering Algorithm for Chained Codes"],"prefix":"10.1109","author":[{"given":"Ben","family":"Langton","sequence":"first","affiliation":[{"name":"Harvey Mudd College,Claremont,CA,USA,91711"}]},{"given":"Netanel","family":"Raviv","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis,St. Louis,MO,USA,63103"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(97)x8001-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3115433"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834800"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057039"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.651015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77224-8_40"},{"key":"ref7","first-page":"311","article-title":"Support weight distribution of linear codes","volume-title":"Discrete Mathematics 106-107","author":"Kl\u00f8ve","year":"1992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206543"},{"key":"ref9","first-page":"453","article-title":"An Upper Bound on Covering Radius","volume-title":"Combinatorial Mathematics","volume":"75","author":"Mattson","year":"1983"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.259662"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206543.pdf?arnumber=10206543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:16Z","timestamp":1773347236000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206543\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206543","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}