{"id":"https://openalex.org/W2515089396","doi":"https://doi.org/10.1109/isit.2016.7541757","title":"Performance bounds for quantized LDPC decoders based on absorbing sets","display_name":"Performance bounds for quantized LDPC decoders based on absorbing sets","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2515089396","doi":"https://doi.org/10.1109/isit.2016.7541757","mag":"2515089396"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of 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, 88003, USA","Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, 88003, USA","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM","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":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of 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":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of 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.1817,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82230124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2539","last_page":"2543"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9973999857902527,"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.9927999973297119,"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.9233765602111816},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7248179912567139},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.6551343202590942},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5823971033096313},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.551360011100769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5394900441169739},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.49341264367103577},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49181678891181946},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46809840202331543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3404419422149658},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2032642364501953}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9233765602111816},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7248179912567139},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.6551343202590942},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5823971033096313},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.551360011100769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5394900441169739},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.49341264367103577},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49181678891181946},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46809840202331543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3404419422149658},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2032642364501953},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":11,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1979802120","https://openalex.org/W1983904405","https://openalex.org/W2041402079","https://openalex.org/W2088738423","https://openalex.org/W2128765501","https://openalex.org/W2154663979","https://openalex.org/W2164156607","https://openalex.org/W2170998175","https://openalex.org/W4285719527","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W1968533815","https://openalex.org/W2808439818","https://openalex.org/W2126464345","https://openalex.org/W2150639697","https://openalex.org/W2090897912","https://openalex.org/W2351144917","https://openalex.org/W2142415334","https://openalex.org/W2125154953","https://openalex.org/W2996745071","https://openalex.org/W4312422976"],"abstract_inverted_index":{"A":[0],"code-independent":[1],"performance":[2],"bound":[3,32],"for":[4,11,68],"a":[5,29,47],"given":[6,48],"absorbing":[7,22,44,111],"set":[8,23,45],"is":[9,53,97],"derived":[10],"quantized":[12,95],"low-density":[13],"parity-check":[14],"(LDPC)":[15],"decoders.":[16],"The":[17],"analysis":[18],"demonstrates":[19],"that":[20,43,80,92],"each":[21],"in":[24],"the":[25,34,74,84,89,93,106],"Tanner":[26],"graph":[27],"imposes":[28],"specific":[30],"lower":[31],"on":[33],"frame":[35],"error":[36],"rate":[37],"(FER)":[38],"of":[39,100],"any":[40,56,62],"code":[41],"containing":[42],"under":[46],"quantization":[49,66],"scheme.":[50],"This":[51],"approach":[52],"applicable":[54],"to":[55],"message-passing":[57],"(MP)":[58],"decoding":[59],"algorithm":[60,76],"and":[61],"uniform":[63],"or":[64],"non-uniform":[65],"scheme":[67],"LDPC":[69,107],"codes.":[70],"Simulation":[71],"results":[72],"using":[73],"sum-product":[75],"(SPA)":[77],"provide":[78],"FERs":[79,104],"are":[81],"consistent":[82],"with":[83],"obtained":[85],"bounds.":[86],"In":[87],"addition,":[88],"bounds":[90],"demonstrate":[91],"conventional":[94],"SPA":[96],"not":[98],"capable":[99],"achieving":[101],"very":[102],"low":[103],"if":[105],"codes":[108],"contain":[109],"certain":[110],"sets.":[112]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}