{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:25Z","timestamp":1773377005530,"version":"3.50.1"},"reference-count":28,"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.11195388","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":0,"title":["Higher-Order Staircase Codes: A Unified Generalization of High-Throughput Coding Techniques"],"prefix":"10.1109","author":[{"given":"Mohannad","family":"Shehadeh","sequence":"first","affiliation":[{"name":"University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[{"name":"University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2175479"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2019.8929906"},{"key":"ref3","volume-title":"Open ZR+ MSA technical specification","year":"2023"},{"key":"ref4","article-title":"Continuously interleaved error correction","volume-title":"U.S. Patent US8276047B2","author":"Coe","year":"2012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3185065"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16250-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2863371"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053951"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-021-00912-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.822737"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.09.120441"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1364\/OFC.2024.W4C.2","article-title":"Generalized staircase codes with arbitrary bit degree","volume-title":"Proc. Opt. Fiber Commun. Conf. (OFC)","author":"Shehadeh","year":"2024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054541"},{"key":"ref15","article-title":"decsim","volume-title":"GitHub repository","author":"Kschischang","year":"2024"},{"key":"ref16","volume-title":"hosc-software","author":"Shehadeh","year":"2024"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.605606"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.32165"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.127"},{"key":"ref20","first-page":"629","article-title":"Perfect systems of difference sets and additive sequences of permutations","volume-title":"Proc. 10th South-Eastern Conf. Combinatorics, Graph Theory Comput.","author":"Kotzig","year":"1979"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-10490"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-10624"},{"key":"ref23","first-page":"18","article-title":"Graceful graphs, radio antennae and French windmills","volume-title":"Proc. One Day Combinatorics Conf., ser. Res. Notes Math.","volume":"34","author":"Bermond","year":"1979"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20259"},{"key":"ref25","volume-title":"Optimal difference triangle sets","author":"Shearer","year":"2005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-0208(08)73504-7"},{"key":"ref27","article-title":"Design of (0,1) sequence sets for pulsed coded systems","author":"Khansefid","year":"1988","journal-title":"Commun. Sci. Inst., Tech. Rep. CSI-88\u20130-03"},{"key":"ref28","article-title":"Difference triangle sets - upper bounds","volume-title":"Archived copy","author":"Shearer","year":"2005"}],"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\/11195388.pdf?arnumber=11195388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:54Z","timestamp":1773347394000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195388","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}