{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:45Z","timestamp":1773377025483,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195499","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Design of Storage Codes Based on Integer Arithmetic Modulo a Power of Two"],"prefix":"10.1109","author":[{"given":"Kenneth W.","family":"Shum","sequence":"first","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen,Shenzhen,China"}]},{"given":"Zhihang","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen,Shenzhen,China"}]},{"given":"Yongyi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen,Shenzhen,China"}]},{"given":"Ruizhe","family":"Wang","sequence":"additional","affiliation":[{"name":"ETH Zürich,Dept. of Information Tech. and Electrical Engineering,Zürich,Switzerland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TBIOM.2023.3340306"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3383849"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW61385.2024.10806918"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3622163"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref6","first-page":"15","article-title":"Erasure coding in Windows Azure storage","volume-title":"USENIX Annual Technical Conference (ATC)","author":"Huang"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605119"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512864"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854717"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2844216"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2882849"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref21","first-page":"401406","article-title":"Improved construction for multiplicative repetition based non-binary polar codes","volume-title":"IEEE Inf. Theory Workshop (ITW)","author":"Deng"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195237"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.532906"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.1997.0189"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-004-1717-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2010.03.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3351760"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195499.pdf?arnumber=11195499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:07Z","timestamp":1773347407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195499","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}