{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:17:08Z","timestamp":1778098628975,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Physical Communication"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.phycom.2026.103111","type":"journal-article","created":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:35:27Z","timestamp":1775896527000},"page":"103111","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Soft-aided iterative ORBGRAND with scaled reliability: Beyond the error-correction bound of product codes"],"prefix":"10.1016","volume":"76","author":[{"given":"Marzieh","family":"Nezamabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9898-7744","authenticated-orcid":false,"given":"Reza","family":"Asvadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud Ahmadian","family":"Attari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.phycom.2026.103111_bib0001","first-page":"29","article-title":"Error-free coding","volume":"IT-4","author":"Elias","year":"1954","journal-title":"IRE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.phycom.2026.103111_bib0002","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/JLT.2011.2175479","article-title":"Staircase codes: FEC for 100 Gb\/s OTN","volume":"30","author":"Smith","year":"2011","journal-title":"J. Lightwave Technol."},{"issue":"19","key":"10.1016\/j.phycom.2026.103111_bib0003","first-page":"6397","article-title":"Zipper codes","volume":"40","author":"Sukmadji","year":"2022","journal-title":"J. Lightwave Technol."},{"key":"10.1016\/j.phycom.2026.103111_bib0004","unstructured":"OIF, Implementation agreement 400-ZR, 2022, [Online]. Available: https:\/\/www.oiforum.com\/wp-content\/uploads\/OIF-400ZR-02.0.pdf."},{"key":"10.1016\/j.phycom.2026.103111_bib0005","series-title":"1994 IEEE GLOBECOM. Communications: The Global Bridge","article-title":"Near optimum decoding of product codes","author":"Pyndiah","year":"1994"},{"issue":"2","key":"10.1016\/j.phycom.2026.103111_bib0006","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1109\/TCOMM.2011.121410.090146","article-title":"Performance of product codes and related structures with iterated decoding","volume":"59","author":"Justesen","year":"2011","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"10.1016\/j.phycom.2026.103111_bib0007","doi-asserted-by":"crossref","first-page":"2797","DOI":"10.1109\/TCOMM.2018.2816073","article-title":"Approaching miscorrection-free performance of product codes with anchor decoding","volume":"66","author":"H\u00e4ger","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.phycom.2026.103111_bib0008","series-title":"2021 IEEE Global Communications Conference (GLOBECOM)","first-page":"1","article-title":"iGRAND: decode any product code","author":"Galligan","year":"2021"},{"issue":"9","key":"10.1016\/j.phycom.2026.103111_bib0009","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1109\/LCOMM.2024.3436699","article-title":"A dynamic-confined iterative GRAND algorithm with anchor decoding for product codes","volume":"28","author":"Peng","year":"2024","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"10.1016\/j.phycom.2026.103111_bib0010","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.1109\/LCOMM.2025.3581563","article-title":"Dynamic-confined iterative guessing codeword decoding for product codes","volume":"29","author":"Peng","year":"2025","journal-title":"IEEE Commun. Lett."},{"issue":"12","key":"10.1016\/j.phycom.2026.103111_bib0011","doi-asserted-by":"crossref","first-page":"8167","DOI":"10.1109\/TCOMM.2019.2940180","article-title":"Binary message passing decoding of product-like codes","volume":"67","author":"Sheikh","year":"2019","journal-title":"IEEE Trans. Commun."},{"issue":"15","key":"10.1016\/j.phycom.2026.103111_bib0012","doi-asserted-by":"crossref","first-page":"4958","DOI":"10.1109\/JLT.2021.3081586","article-title":"Refined reliability combining for binary message passing decoding of product codes","volume":"39","author":"Sheikh","year":"2021","journal-title":"J. Lightwave Technol."},{"issue":"15","key":"10.1016\/j.phycom.2026.103111_bib0013","doi-asserted-by":"crossref","first-page":"4909","DOI":"10.1109\/JLT.2021.3078172","article-title":"Novel high-throughput decoding algorithms for product and staircase codes based on error-and-erasure decoding","volume":"39","author":"Sheikh","year":"2021","journal-title":"J. Lightwave Technol."},{"issue":"5","key":"10.1016\/j.phycom.2026.103111_bib0014","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.1109\/TCOMM.2024.3484935","article-title":"Iterative bounded distance decoding with random flipping for product-like codes","volume":"73","author":"Li","year":"2025","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"10.1016\/j.phycom.2026.103111_bib0015","doi-asserted-by":"crossref","first-page":"5241","DOI":"10.1109\/TCOMM.2024.3383104","article-title":"A threshold-based binary message passing decoder with memory for product codes","volume":"72","author":"Zhao","year":"2024","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"10.1016\/j.phycom.2026.103111_bib0016","doi-asserted-by":"crossref","first-page":"4023","DOI":"10.1109\/TIT.2019.2896110","article-title":"Capacity-achieving guessing random additive noise decoding","volume":"65","author":"Duffy","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.phycom.2026.103111_bib0017","doi-asserted-by":"crossref","first-page":"4528","DOI":"10.1109\/TSP.2022.3203251","article-title":"Ordered reliability bits guessing random additive noise decoding","volume":"70","author":"Duffy","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.phycom.2026.103111_bib0018","series-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"Moon","year":"2005"},{"key":"10.1016\/j.phycom.2026.103111_bib0019","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"2696","article-title":"Approaching capacity at high rates with iterative hard decision decoding","author":"Jian","year":"2012"},{"issue":"5","key":"10.1016\/j.phycom.2026.103111_bib0020","doi-asserted-by":"crossref","first-page":"2830","DOI":"10.1109\/TIT.2022.3230782","article-title":"ORBGRAND is almost capacity-achieving","volume":"69","author":"Liu","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.phycom.2026.103111_bib0021","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TCOMM.2021.3118789","article-title":"Error-and-erasure decoding of product and staircase codes","volume":"70","author":"Rapp","year":"2022","journal-title":"IEEE Trans. Commun."}],"container-title":["Physical Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490726001205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490726001205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T19:46:19Z","timestamp":1778096779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1874490726001205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":21,"alternative-id":["S1874490726001205"],"URL":"https:\/\/doi.org\/10.1016\/j.phycom.2026.103111","relation":{},"ISSN":["1874-4907"],"issn-type":[{"value":"1874-4907","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Soft-aided iterative ORBGRAND with scaled reliability: Beyond the error-correction bound of product codes","name":"articletitle","label":"Article Title"},{"value":"Physical Communication","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.phycom.2026.103111","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103111"}}