{"id":"https://openalex.org/W2886576268","doi":"https://doi.org/10.1109/isit.2018.8437710","title":"Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets","display_name":"Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886576268","doi":"https://doi.org/10.1109/isit.2018.8437710","mag":"2886576268"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5074021248","display_name":"Homayoon Hatami","orcid":"https://orcid.org/0000-0001-6217-3415"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Homayoon Hatami","raw_affiliation_strings":["University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076523933","display_name":"David G. M. Mitchell","orcid":"https://orcid.org/0000-0002-3544-9225"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G.M. Mitchell","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002338945","display_name":"Thomas E. Fuja","orcid":"https://orcid.org/0000-0003-0026-8499"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Fuja","raw_affiliation_strings":["University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1858,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81500433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"826","last_page":"830"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9986000061035156,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9955999851226807,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9446799755096436},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.6939893960952759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6386255621910095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5469567179679871},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.526820182800293},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5197914838790894},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4752911329269409},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4154210090637207},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.36409127712249756},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1504303514957428}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9446799755096436},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.6939893960952759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6386255621910095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5469567179679871},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.526820182800293},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5197914838790894},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4752911329269409},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4154210090637207},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.36409127712249756},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1504303514957428}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1864365761","https://openalex.org/W1972036717","https://openalex.org/W1985001547","https://openalex.org/W1991528082","https://openalex.org/W2041402079","https://openalex.org/W2102105592","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2170998175","https://openalex.org/W2172679141","https://openalex.org/W2515089396","https://openalex.org/W2519093122","https://openalex.org/W2521520100","https://openalex.org/W2583537123","https://openalex.org/W2743484031","https://openalex.org/W2784016542","https://openalex.org/W3100523383","https://openalex.org/W3125530803","https://openalex.org/W4285719527","https://openalex.org/W6628810906","https://openalex.org/W6732909938"],"related_works":["https://openalex.org/W2591644370","https://openalex.org/W2164397492","https://openalex.org/W2374503462","https://openalex.org/W2041362683","https://openalex.org/W2350834058","https://openalex.org/W2365740713","https://openalex.org/W2106520586","https://openalex.org/W2347549085","https://openalex.org/W2391411392","https://openalex.org/W2258688491"],"abstract_inverted_index":{"Absorbing":[0],"sets":[1,56],"are":[2,41,48],"known":[3,49],"to":[4,50,64],"be":[5],"the":[6,10,23,85,106,109],"primary":[7],"factor":[8],"in":[9],"error-floor":[11,67,124],"performance":[12,86,125],"of":[13,87,108],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"codes":[17,39,121],"with":[18],"message":[19],"passing":[20],"decoders":[21],"over":[22],"additive":[24],"white":[25],"Gaussian":[26],"noise":[27],"(AWGN)":[28],"channel.":[29],"Besides":[30],"showing":[31],"excellent":[32],"waterfall":[33],"performance,":[34],"spatially":[35],"coupled":[36],"LDPC":[37,77,129],"(SC-LDPC)":[38],"that":[40],"constructed":[42],"by":[43],"an":[44],"edge":[45],"spreading":[46],"technique":[47],"have":[51,122],"fewer":[52],"cycles":[53],"and":[54,62,97,112],"absorbing":[55],"than":[57,126],"their":[58,127],"block":[59,78,130],"code":[60],"counterparts,":[61],"therefore":[63],"exhibit":[65],"better":[66,123],"performance.":[68],"Based":[69],"on":[70,84],"our":[71],"previously":[72],"obtained":[73,110],"results":[74,104],"for":[75,115],"quantized":[76,88,116],"decoders,":[79,90,117],"we":[80],"derive":[81],"lower":[82],"bounds":[83,111],"SC-LDPC":[89,120],"including":[91],"both":[92],"a":[93,98],"flooding":[94],"schedule":[95],"decoder":[96],"sliding":[99],"window":[100],"decoder.":[101],"Numerical":[102],"simulation":[103],"confirm":[105],"accuracy":[107],"show":[113],"that,":[114],"properly":[118],"designed":[119],"underlying":[128],"codes.":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}