{"id":"https://openalex.org/W4289655404","doi":"https://doi.org/10.1109/isit50566.2022.9834404","title":"Cycle-Free Windows of SC-LDPC Codes","display_name":"Cycle-Free Windows of SC-LDPC Codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655404","doi":"https://doi.org/10.1109/isit50566.2022.9834404"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834404","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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":"https://openalex.org/A5085524538","display_name":"Emily McMillon","orcid":"https://orcid.org/0000-0002-1239-3564"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Emily McMillon","raw_affiliation_strings":["University of Nebraska–Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"],"affiliations":[{"raw_affiliation_string":"University of Nebraska–Lincoln,Department of Mathematics,Lincoln,Nebraska,68588","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072790914","display_name":"Christine A. Kelley","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christine A. Kelley","raw_affiliation_strings":["University of Nebraska–Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"],"affiliations":[{"raw_affiliation_string":"University of Nebraska–Lincoln,Department of Mathematics,Lincoln,Nebraska,68588","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085524538"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.4321,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46520957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"390","last_page":"395"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9950000047683716,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8653334975242615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6214776039123535},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6051062345504761},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5970754623413086},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5756031274795532},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5125727653503418},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.5122765898704529},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.46266746520996094},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.4446665048599243},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44440558552742004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44164031744003296},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.41776710748672485},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3320590853691101},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.04854005575180054}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8653334975242615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6214776039123535},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6051062345504761},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5970754623413086},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5756031274795532},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5125727653503418},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.5122765898704529},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.46266746520996094},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.4446665048599243},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44440558552742004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44164031744003296},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.41776710748672485},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3320590853691101},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.04854005575180054},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834404","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1864365761","https://openalex.org/W1945304109","https://openalex.org/W1972036717","https://openalex.org/W1985001547","https://openalex.org/W1991528082","https://openalex.org/W2074450800","https://openalex.org/W2095882513","https://openalex.org/W2100465297","https://openalex.org/W2127875464","https://openalex.org/W2148981492","https://openalex.org/W2172679141","https://openalex.org/W2964138646","https://openalex.org/W6600302457"],"related_works":["https://openalex.org/W2116328306","https://openalex.org/W2119750293","https://openalex.org/W2083549688","https://openalex.org/W2794735813","https://openalex.org/W3178186812","https://openalex.org/W2963011652","https://openalex.org/W2076859597","https://openalex.org/W2117239414","https://openalex.org/W2374716075","https://openalex.org/W2591644370"],"abstract_inverted_index":{"In":[0,41],"this":[1],"paper,":[2],"we":[3,54,68],"define":[4],"a":[5,18,22],"window":[6,39,65,84],"code":[7,15,78],"to":[8,74],"be":[9],"the":[10,27,38,59],"portion":[11],"of":[12,21,29,37,63],"an":[13,76],"SC-LDPC":[14,30,77],"seen":[16],"by":[17],"single":[19],"iteration":[20],"windowed":[23,33],"decoder.":[24],"We":[25],"consider":[26],"design":[28],"codes":[31,49],"for":[32],"decoding":[34,45],"via":[35],"optimization":[36],"code.":[40],"particular,":[42],"because":[43],"iterative":[44],"is":[46,72],"optimal":[47],"on":[48],"with":[50,79,82],"cycle-free":[51,64,83],"graph":[52],"representations,":[53],"ask":[55],"fundamental":[56],"questions":[57],"about":[58],"construction":[60],"and":[61,81],"parameters":[62],"codes.":[66,85],"Further,":[67],"show":[69],"that":[70],"it":[71],"possible":[73],"have":[75],"cycles":[80]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}