{"id":"https://openalex.org/W7092652594","doi":"https://doi.org/10.1109/isit63088.2025.11195388","title":"Higher-Order Staircase Codes: A Unified Generalization of High-Throughput Coding Techniques","display_name":"Higher-Order Staircase Codes: A Unified Generalization of High-Throughput Coding Techniques","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092652594","doi":"https://doi.org/10.1109/isit63088.2025.11195388"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mohannad Shehadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I75717288","display_name":"Rogers (United States)","ror":"https://ror.org/05m9vrv91","country_code":"US","type":"company","lineage":["https://openalex.org/I75717288"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Mohannad Shehadeh","raw_affiliation_strings":["University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4"],"affiliations":[{"raw_affiliation_string":"University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4","institution_ids":["https://openalex.org/I185261750","https://openalex.org/I75717288"]}]},{"author_position":"last","author":{"id":null,"display_name":"Frank R. Kschischang","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I75717288","display_name":"Rogers (United States)","ror":"https://ror.org/05m9vrv91","country_code":"US","type":"company","lineage":["https://openalex.org/I75717288"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Frank R. Kschischang","raw_affiliation_strings":["University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4"],"affiliations":[{"raw_affiliation_string":"University of Toronto,The Edward S. Rogers Sr. Department of Electrical & Computer Engineering,Toronto,ON,Canada,M5S 3G4","institution_ids":["https://openalex.org/I185261750","https://openalex.org/I75717288"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I75717288"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78093469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8185999989509583,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8185999989509583,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.05460000038146973,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.029500000178813934,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.682699978351593},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5745000243186951},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5498999953269958},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5113999843597412},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5027999877929688},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4489000141620636},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3828999996185303},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.38190001249313354}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.682699978351593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5939000248908997},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5745000243186951},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5498999953269958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5260000228881836},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5113999843597412},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4489000141620636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4004000127315521},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38659998774528503},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.38190001249313354},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C105782903","wikidata":"https://www.wikidata.org/wiki/Q6577686","display_name":"Zipper","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.325300008058548},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.32089999318122864},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31439998745918274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.313400000333786},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.27390000224113464},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Gender equality","id":"https://metadata.un.org/sdg/5","score":0.4631924629211426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W161202988","https://openalex.org/W2010325636","https://openalex.org/W2012378218","https://openalex.org/W2065150811","https://openalex.org/W2074196758","https://openalex.org/W2110463367","https://openalex.org/W2129096636","https://openalex.org/W2148948564","https://openalex.org/W2153810958","https://openalex.org/W2165083003","https://openalex.org/W2529747660","https://openalex.org/W2530363278","https://openalex.org/W2903952412","https://openalex.org/W2995195322","https://openalex.org/W3174852697","https://openalex.org/W3186432588","https://openalex.org/W4205545339","https://openalex.org/W4285159498","https://openalex.org/W4396909551"],"related_works":[],"abstract_inverted_index":{"We":[0,66,93],"introduce":[1],"a":[2],"unified":[3],"generalization":[4,35],"of":[5,46,71,88,97],"several":[6],"well-established":[7],"high-throughput":[8],"coding":[9,80],"techniques":[10],"including":[11],"staircase":[12,40,111],"codes,":[13,17,20,26,73],"tiled":[14],"diagonal":[15],"zipper":[16],"continuously":[18],"interleaved":[19],"open":[21],"forward":[22],"error":[23],"correction":[24],"(OFEC)":[25],"and":[27,54,78,104],"Robinson-Bernstein":[28],"convolutional":[29],"codes":[30],"as":[31],"special":[32],"cases.":[33],"This":[34],"which":[36,57,106],"we":[37],"term":[38],"\u201chigher-order":[39],"codes\u201d":[41],"arises":[42],"from":[43],"the":[44],"marriage":[45],"two":[47],"distinct":[48],"combinatorial":[49],"objects:":[50],"difference":[51,98],"triangle":[52,99],"sets":[53,100],"finite-geometric":[55],"nets,":[56],"have":[58],"typically":[59],"been":[60],"applied":[61],"separately":[62],"to":[63,108],"code":[64],"design.":[65],"illustrate":[67],"one":[68],"possible":[69],"realization":[70],"these":[72],"obtaining":[74],"powerful,":[75],"highrate,":[76],"low-error-floor,":[77],"low-complexity":[79],"schemes":[81],"based":[82],"on":[83],"simple":[84],"iterative":[85],"syndrome-domain":[86],"decoding":[87],"coupled":[89],"Hamming":[90],"component":[91],"codes.":[92,112],"study":[94],"some":[95],"properties":[96],"having":[101],"minimum":[102],"scope":[103],"sum-of-lengths,":[105],"correspond":[107],"memory-optimal":[109],"higher-order":[110]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-21T00:00:00"}