{"id":"https://openalex.org/W2142072790","doi":"https://doi.org/10.1109/isit.2008.4594994","title":"Sparse representations for codes and the hardness of decoding LDPC codes","display_name":"Sparse representations for codes and the hardness of decoding LDPC codes","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2142072790","doi":"https://doi.org/10.1109/isit.2008.4594994","mag":"2142072790"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4594994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5053809539","display_name":"Nandakishore Santhi","orcid":"https://orcid.org/0000-0002-4755-7821"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nandakishore Santhi","raw_affiliation_strings":["Theoretical Division, CCS Division and the Center, Los Alamos, NM, USA","Theor. Div., LANL, Los Alamos, NM"],"affiliations":[{"raw_affiliation_string":"Theoretical Division, CCS Division and the Center, Los Alamos, NM, USA","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"Theor. Div., LANL, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053809539"],"corresponding_institution_ids":["https://openalex.org/I1343871089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15504374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"290","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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.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/T11130","display_name":"Coding theory and cryptography","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8178048133850098},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6892759799957275},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6341108083724976},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6332627534866333},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5882094502449036},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5539080500602722},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5454443693161011},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5422834157943726},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5147705078125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5041292905807495},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5017836093902588},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.45344406366348267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44569963216781616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4302001893520355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37316393852233887}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8178048133850098},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6892759799957275},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6341108083724976},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6332627534866333},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5882094502449036},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5539080500602722},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5454443693161011},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5422834157943726},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5147705078125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5041292905807495},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5017836093902588},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.45344406366348267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44569963216781616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4302001893520355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37316393852233887},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2008.4594994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1998242373","https://openalex.org/W2011039300","https://openalex.org/W2035929826","https://openalex.org/W2146489710","https://openalex.org/W2147819057","https://openalex.org/W3105513639","https://openalex.org/W3124850851","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2118148379","https://openalex.org/W1978153242","https://openalex.org/W2159021452","https://openalex.org/W2167340446","https://openalex.org/W2010879611"],"abstract_inverted_index":{"The":[0,58,92],"maximum":[1,40],"likelihood":[2,41],"decoding":[3,17,42,81,88],"problem":[4,44,53,82,94],"is":[5,18,95],"known":[6,19],"to":[7,20,49,78,86,99,127],"be":[8,76],"NP-hard":[9],"for":[10,25,45,54,66,83],"binary":[11,46],"linear":[12,47],"codes,":[13],"while":[14],"belief":[15,103],"propagation":[16,104],"work":[21],"well":[22],"in":[23,116],"practice":[24],"several":[26,117],"LDPC":[27,56],"codes.":[28,57,68,91],"In":[29],"this":[30],"paper":[31],"we":[32,110],"give":[33],"a":[34,72],"polynomial":[35],"time":[36],"reduction":[37,59,115],"from":[38],"the":[39,50,61,80,87,100,113],"(MLD)":[43],"codes":[48,85],"weighted":[51,64],"MLD":[52,65],"(3,3)-":[55],"proves":[60],"NP-hardness":[62],"of":[63,89,102,108,121],"(3,3)-LDPC":[67],"It":[69],"also":[70],"provides":[71],"method":[73],"which":[74,122],"can":[75],"used":[77],"transform":[79],"dense":[84],"sparse":[90],"later":[93],"often":[96],"more":[97],"amenable":[98],"use":[101],"algorithm.":[105],"For":[106],"ease":[107],"presentation,":[109],"have":[111],"organized":[112],"total":[114],"intermediate":[118],"reductions,":[119],"most":[120],"are":[123],"elementary":[124],"and":[125],"easy":[126],"follow.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}