{"id":"https://openalex.org/W2006742572","doi":"https://doi.org/10.1109/isit.2014.6875274","title":"ADMM decoding of non-binary LDPC codes in F&lt;inf&gt;2m&lt;/inf&gt;","display_name":"ADMM decoding of non-binary LDPC codes in F&lt;inf&gt;2m&lt;/inf&gt;","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2006742572","doi":"https://doi.org/10.1109/isit.2014.6875274","mag":"2006742572"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5008392683","display_name":"Xishuo Liu","orcid":"https://orcid.org/0000-0002-2855-2910"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xishuo Liu","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., University of Wisconsin-Madison, Madison, WI, USA","Dept. of Electr. & Comput. Eng., Univ. of Wisconsin Madison, Madison, WI, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., University of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Wisconsin Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029182703","display_name":"Stark C. Draper","orcid":"https://orcid.org/0000-0001-8100-5599"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stark C. Draper","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., University of Toronto, Toronto, ON, Canada","Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008392683"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":0.36767639,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65067086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2449","last_page":"2453"},"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.9990000128746033,"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.9950000047683716,"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.7607738971710205},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7175928354263306},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6326796412467957},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6220625638961792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5925114154815674},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5310493111610413},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5125979781150818},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4734594225883484},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.45747116208076477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45039644837379456},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4293854534626007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.427263468503952},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34682750701904297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3394017815589905},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.20645514130592346},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19165751338005066},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.16893270611763}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7607738971710205},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7175928354263306},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6326796412467957},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6220625638961792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5925114154815674},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5310493111610413},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5125979781150818},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4734594225883484},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.45747116208076477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45039644837379456},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4293854534626007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.427263468503952},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34682750701904297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3394017815589905},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.20645514130592346},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19165751338005066},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.16893270611763},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/isit.2014.6875274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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":14,"referenced_works":["https://openalex.org/W1644601915","https://openalex.org/W1930904828","https://openalex.org/W1978259121","https://openalex.org/W1988024462","https://openalex.org/W1995786820","https://openalex.org/W2006309149","https://openalex.org/W2065212815","https://openalex.org/W2068582919","https://openalex.org/W2109866575","https://openalex.org/W2148673346","https://openalex.org/W2169134868","https://openalex.org/W2170862479","https://openalex.org/W3098358453","https://openalex.org/W6640561268"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2507185596","https://openalex.org/W1493684871","https://openalex.org/W4286224459","https://openalex.org/W2886567582","https://openalex.org/W4289703404","https://openalex.org/W4387265813","https://openalex.org/W2977214684"],"abstract_inverted_index":{"In":[0,69],"this":[1,70],"paper,":[2],"we":[3,72],"develop":[4],"an":[5],"efficient":[6],"algorithm":[7,22,137],"for":[8],"linear":[9],"programming":[10],"(LP)":[11],"decoding":[12,40,136],"of":[13,33,49,59,79],"non-binary":[14,61,75],"low-density":[15],"parity-check":[16,63],"(LDPC)":[17],"codes.":[18],"We":[19,106,117],"build":[20],"our":[21],"on":[23,28,74],"the":[24,29,38,60,95,113,126],"decomposition":[25],"method":[26,32],"based":[27],"alternating":[30],"direction":[31],"multipliers":[34],"(ADMM).":[35],"Although":[36],"expressing":[37],"LP":[39],"problem":[41],"using":[42],"ADMM":[43,50,120],"is":[44,66,103,130],"not":[45,67],"hard,":[46],"a":[47,54,100,108,121,131],"sub-routine":[48],"-":[51,65],"projection":[52,127],"onto":[53],"polytope":[55,96],"formed":[56],"from":[57],"embeddings":[58],"single":[62],"code":[64],"straightforward.":[68],"work,":[71],"focus":[73],"codes":[76],"in":[77,88],"fields":[78],"characteristic":[80],"two.":[81],"This":[82],"allows":[83],"us":[84],"to":[85,93,124],"use":[86],"operations":[87],"F":[89],"<sub":[90],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[92],"relax":[94],"under":[97,115],"consideration":[98],"into":[99],"form":[101],"that":[102,111],"computational":[104],"friendly.":[105],"introduce":[107],"rotation":[109],"step":[110],"normalizes":[112],"geometry":[114],"consideration.":[116],"then":[118],"apply":[119],"second":[122],"time":[123],"solve":[125],"problem,":[128],"which":[129],"quadratic":[132],"program":[133],"(QP).":[134],"Our":[135],"scales":[138],"linearly":[139,143],"with":[140,144,149],"block":[141],"length,":[142],"check":[145],"degree,":[146],"and":[147],"quadratically":[148],"field":[150],"size.":[151]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
