{"id":"https://openalex.org/W2098767736","doi":"https://doi.org/10.1109/cig.2010.5592887","title":"Improved linear programming decoding and bounds on the minimum distance of LDPC codes","display_name":"Improved linear programming decoding and bounds on the minimum distance of LDPC codes","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2098767736","doi":"https://doi.org/10.1109/cig.2010.5592887","mag":"2098767736"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2010.5592887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","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/A5007290326","display_name":"David Burshtein","orcid":"https://orcid.org/0000-0001-7255-1360"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"David Burshtein","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048986376","display_name":"Idan Goldenberg","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Idan Goldenberg","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering , Tel-Aviv University , Tel-Aviv 69978 , Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007290326"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":2.849,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91145122,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9991999864578247,"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.9932000041007996,"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/decoding-methods","display_name":"Decoding methods","score":0.7481124401092529},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7351691722869873},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6702194809913635},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5833913087844849},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5294011831283569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5145642161369324},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5021109580993652},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4810536205768585},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4738350808620453},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4459972381591797},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4438042938709259},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4420570731163025},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.43683740496635437},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43539178371429443},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4192866086959839},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41251328587532043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4024249315261841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38921183347702026}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7481124401092529},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7351691722869873},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6702194809913635},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5833913087844849},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5294011831283569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5145642161369324},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5021109580993652},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4810536205768585},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4738350808620453},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4459972381591797},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4438042938709259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4420570731163025},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.43683740496635437},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43539178371429443},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4192866086959839},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41251328587532043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4024249315261841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38921183347702026},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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/cig.2010.5592887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1875056259","https://openalex.org/W2085806398","https://openalex.org/W2089745384","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2172190188","https://openalex.org/W2952346284","https://openalex.org/W6639344520"],"related_works":["https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2116533133","https://openalex.org/W2167124952","https://openalex.org/W2011293233","https://openalex.org/W2169710030","https://openalex.org/W4388717827","https://openalex.org/W2065071381"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,32],"technique":[3,16],"for":[4],"improving":[5],"LP":[6,35],"decoding,":[7],"based":[8],"on":[9,45,79,90],"the":[10,46,62,71,80,91,95],"merging":[11,74],"of":[12,49,94],"check":[13,72],"nodes.":[14],"This":[15,65],"can":[17,37,67],"be":[18,38,68,86],"applied":[19],"to":[20,40,61,85],"standard":[21],"as":[22,24],"well":[23],"generalized":[25],"LDPC":[26,51],"codes.":[27],"Furthermore,":[28],"we":[29],"show":[30],"how":[31],"recently-discovered":[33],"linear-complexity":[34],"decoder":[36],"used":[39],"derive":[41],"non-trivial":[42],"lower":[43,77],"bounds":[44],"minimum":[47,81],"distance":[48,82,93],"specific":[50],"codes,":[52],"with":[53,59],"complexity":[54],"that":[55],"exhibits":[56],"quadratic":[57],"growth":[58],"respect":[60],"block":[63],"length.":[64],"bound":[66,78,89],"refined":[69],"using":[70],"node":[73],"technique.":[75],"The":[76],"is":[83],"shown":[84],"an":[87],"upper":[88],"fractional":[92],"code.":[96]},"counts_by_year":[{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}