{"id":"https://openalex.org/W4386075075","doi":"https://doi.org/10.1109/isit54713.2023.10206818","title":"On Sparse Regression LDPC Codes","display_name":"On Sparse Regression LDPC Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075075","doi":"https://doi.org/10.1109/isit54713.2023.10206818"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206818","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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/A5041640279","display_name":"Jamison R. Ebert","orcid":"https://orcid.org/0000-0002-2898-7404"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jamison R. Ebert","raw_affiliation_strings":["Texas A&M University,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069801730","display_name":"Jean\u2010Fran\u00e7ois Chamberland","orcid":"https://orcid.org/0000-0002-2983-9884"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean-Francois Chamberland","raw_affiliation_strings":["Texas A&M University,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103158883","display_name":"Krishna R. Narayanan","orcid":"https://orcid.org/0000-0001-5711-3549"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krishna R. Narayanan","raw_affiliation_strings":["Texas A&M University,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041640279"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":2.8128,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91105238,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2350","last_page":"2355"},"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.9922000169754028,"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.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.942084550857544},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.696241557598114},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6744218468666077},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6737557649612427},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.642270565032959},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5759865641593933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5514038801193237},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.549842894077301},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5083121657371521},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4987339973449707},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4778551757335663},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.46727219223976135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4548902213573456},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.43108034133911133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3077971339225769},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2938956618309021},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.22980210185050964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12009182572364807},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0849674642086029}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.942084550857544},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.696241557598114},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6744218468666077},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6737557649612427},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.642270565032959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5759865641593933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5514038801193237},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.549842894077301},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5083121657371521},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4987339973449707},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4778551757335663},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.46727219223976135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4548902213573456},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.43108034133911133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3077971339225769},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2938956618309021},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.22980210185050964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12009182572364807},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0849674642086029},{"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/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/isit54713.2023.10206818","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1837352444","https://openalex.org/W1909826856","https://openalex.org/W1965559626","https://openalex.org/W1982872379","https://openalex.org/W1991528082","https://openalex.org/W2017687288","https://openalex.org/W2039957496","https://openalex.org/W2067038358","https://openalex.org/W2082029531","https://openalex.org/W2088934832","https://openalex.org/W2109489513","https://openalex.org/W2109866575","https://openalex.org/W2119001152","https://openalex.org/W2123119950","https://openalex.org/W2125566184","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2137699000","https://openalex.org/W2137813581","https://openalex.org/W2142511915","https://openalex.org/W2145096794","https://openalex.org/W2150859678","https://openalex.org/W2154887764","https://openalex.org/W2156973751","https://openalex.org/W2157702143","https://openalex.org/W2166347904","https://openalex.org/W2166978909","https://openalex.org/W2169732368","https://openalex.org/W2179644698","https://openalex.org/W2610971674","https://openalex.org/W2616796307","https://openalex.org/W2747773209","https://openalex.org/W2951974280","https://openalex.org/W2963064298","https://openalex.org/W2963072996","https://openalex.org/W3088825007","https://openalex.org/W3092103098","https://openalex.org/W3098848552","https://openalex.org/W3099384592","https://openalex.org/W3102437242","https://openalex.org/W3102543958","https://openalex.org/W3104075626","https://openalex.org/W3104291019","https://openalex.org/W3106105941","https://openalex.org/W3124268854","https://openalex.org/W3162372285","https://openalex.org/W3172643713","https://openalex.org/W3174653886","https://openalex.org/W4226107887","https://openalex.org/W4250955649","https://openalex.org/W4386075075"],"related_works":["https://openalex.org/W2122977448","https://openalex.org/W2124250880","https://openalex.org/W4301665663","https://openalex.org/W2963109230","https://openalex.org/W3177262287","https://openalex.org/W2286197641","https://openalex.org/W2757022491","https://openalex.org/W2978729728","https://openalex.org/W2555468667","https://openalex.org/W2785598795"],"abstract_inverted_index":{"Iterative":[0],"decoding":[1,120],"of":[2,48,141],"graph-based":[3],"codes":[4,35,43,51,86,157],"and":[5,38,59,94,154,162],"sparse":[6,32],"recovery":[7],"through":[8],"approximate":[9],"message":[10],"passing":[11],"(AMP)":[12],"are":[13,45,69],"two":[14],"research":[15],"areas":[16],"that":[17,52,108,133],"have":[18],"seen":[19],"monumental":[20],"progress":[21],"in":[22,164,168,175],"recent":[23],"decades.":[24],"Inspired":[25],"by":[26],"these":[27],"advances,":[28],"this":[29],"article":[30,101],"introduces":[31,102],"regression":[33,42],"LDPC":[34,111,144,156],"(SR-LDPC":[36],"codes)":[37],"their":[39,75],"decoding.":[40],"Sparse":[41],"(SPARCs)":[44],"a":[46,103,115,123,131,165,171],"class":[47],"error":[49,169],"correcting":[50],"build":[53],"on":[54,137],"ideas":[55],"from":[56],"compressed":[57],"sensing":[58],"can":[60,87,95,125],"be":[61,88,97,126],"decoded":[62,89],"using":[63,91,128],"AMP.":[64],"In":[65],"certain":[66],"settings,":[67],"SPARCs":[68,153],"known":[70],"to":[71],"achieve":[72],"capacity;":[73],"yet,":[74],"performance":[76,150],"suffers":[77],"at":[78],"finite":[79,159],"block":[80,160],"lengths.":[81],"Likewise,":[82],"low-density":[83],"parity-check":[84],"(LDPC)":[85],"efficiently":[90],"belief":[92,135],"propagation":[93,136],"also":[96],"capacity":[98],"achieving.":[99],"This":[100],"novel":[104],"concatenated":[105],"coding":[106],"structure":[107],"combines":[109],"an":[110],"outer":[112,143],"code":[113,124],"with":[114,130],"SPARC-inspired":[116],"inner":[117],"code.":[118,145],"Efficient":[119],"for":[121,158],"such":[122],"achieved":[127],"AMP":[129],"denoiser":[132],"performs":[134],"the":[138,142],"factor":[139],"graph":[140],"The":[146],"proposed":[147],"framework":[148],"exhibits":[149],"improvements":[151],"over":[152],"standard":[155],"lengths":[161],"results":[163],"steep":[166],"waterfall":[167],"performance,":[170],"phenomenon":[172],"not":[173],"observed":[174],"uncoded":[176],"SPARCs.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7}],"updated_date":"2026-01-11T23:08:45.486102","created_date":"2025-10-10T00:00:00"}