{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:59Z","timestamp":1773378119985,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834598","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1761-1766","source":"Crossref","is-referenced-by-count":3,"title":["Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity"],"prefix":"10.1109","author":[{"given":"Lakshmi Prasad","family":"Natarajan","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Hyderabad,Department of Electrical Engineering,Sangareddy,India,502 284"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Krishnan","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Signal Processing and Communications Re-Search Center,Hyderabad,India,500032"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Reed-Muller codes achieve capacity on BMS channels","author":"reeves","year":"2021","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0040585X97984449"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.904535"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01119999"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834598"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606832"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.3.293"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834598.pdf?arnumber=9834598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:23Z","timestamp":1773347783000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834598\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834598","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}