{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:17:27Z","timestamp":1775913447225,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541295","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"230-234","source":"Crossref","is-referenced-by-count":134,"title":["Algebraic properties of polar codes from a new polynomial formalism"],"prefix":"10.1109","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[{"name":"Normandie Univ, UR, LITIS, F-76821 Mont-Saint-Aignan, France"}]},{"given":"Vlad","family":"Dragoi","sequence":"additional","affiliation":[{"name":"Normandie Univ, UR, LITIS, F-76821 Mont-Saint-Aignan, France"}]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[{"name":"Normandie Univ, UR, LITIS, F-76821 Mont-Saint-Aignan, France"}]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[{"name":"Inria, SECRET Project, 78153 Le Chesnay Cedex, France"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Reed-Muller codes achieve capacity on the binary erasure channel under MAP decoding","author":"kudekar","year":"2015","journal-title":"arxiv 1505 05831[cs IT]"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90244-C"},{"key":"ref5","article-title":"Reed-Muller codes achieve capacity on erasure channels","author":"kumar","year":"2015","journal-title":"arxiv 1505 05123[cs IT]"},{"key":"ref8","author":"macwilliams","year":"1986","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864425"},{"key":"ref9","article-title":"Polar codes for channel and source coding","author":"korada","year":"2009","journal-title":"Ecole Polytechnique Fédérale de Lausanne (EPFL)"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"ankan","year":"2009","journal-title":"IEEE Trans Inform Theory"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541295.pdf?arnumber=7541295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:57Z","timestamp":1774986837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541295\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541295","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}