{"id":"https://openalex.org/W45690215","doi":null,"title":"Decoding linear codes via optimization and graph-based techniques","display_name":"Decoding linear codes via optimization and graph-based techniques","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W45690215","mag":"45690215"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt0zw766c2","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/0zw766c2","pdf_url":"https://escholarship.org/uc/item/0zw766c2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"volume":null,"type":"dissertation","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/uc/item/0zw766c2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111890001","display_name":"Mohammad Hossein Taghavi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohammad Hossein Taghavi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111890001"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9976000189781189,"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.9976000189781189,"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.001500000013038516,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.00039999998989515007,"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/linear-programming-decoding","display_name":"linear programming decoding","score":0.753000020980835},{"id":"https://openalex.org/keywords/low-density-parity-check-codes","display_name":"LDPC codes","score":0.8579999804496765},{"id":"https://openalex.org/keywords/finite-length-analysis","display_name":"finite-length analysis","score":0.5809999704360962},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8059999942779541},{"id":"https://openalex.org/keywords/intersymbol-interference","display_name":"intersymbol interference","score":0.9240000247955322},{"id":"https://openalex.org/keywords/nonlinear-optical-fibers","display_name":"nonlinear optical fibers","score":0.6660000085830688}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7914983034133911},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.696496844291687},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6773043870925903},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5989464521408081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5593732595443726},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5221343636512756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5207816958427429},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4590010643005371},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4095037281513214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37963396310806274},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.318403422832489},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.09662899374961853}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:escholarship.org/ark:/13030/qt0zw766c2","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/0zw766c2","pdf_url":"https://escholarship.org/uc/item/0zw766c2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"mag:45690215","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/content/qt0zw766c2/qt0zw766c2.pdf?t=lq61m2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt0zw766c2","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/0zw766c2","pdf_url":"https://escholarship.org/uc/item/0zw766c2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5967951057","display_name":"TF-Capacity-Approaching Coding and Detection for Page-Oriented Digital Recording Channels.","funder_award_id":"0514859","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7658639056","display_name":"Code Representation and Performance of Graph-Based Decoding","funder_award_id":"0829865","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W45690215.pdf","grobid_xml":"https://content.openalex.org/works/W45690215.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7100720395","https://openalex.org/W295513270","https://openalex.org/W2104689908","https://openalex.org/W2039069522","https://openalex.org/W7096567379","https://openalex.org/W2146278037","https://openalex.org/W7065517710","https://openalex.org/W19017194","https://openalex.org/W2091534509","https://openalex.org/W4231417541"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"codes":[3,55,292],"have":[4,43],"made":[5],"it":[6,136],"possible":[7],"to":[8,15,103,111,139,160,257,289],"communicate":[9],"at":[10],"information":[11],"rates":[12],"very":[13,69],"close":[14],"the":[16,27,47,60,74,95,122,147,162,168,172,207,244,247,259,266,283,294,302,317,343,348],"Shannon":[17],"capacity":[18,350],"by":[19,106,191,212,226,233,281,329],"combining":[20],"sparsity":[21],"with":[22,56],"quasi-":[23],"randomness,":[24],"which":[25,242,320],"enables":[26],"use":[28],"of":[29,40,50,53,63,76,132,165,174,187,203,215,217,228,237,246,262,285,296,339,345,351],"low-complexity":[30],"iterative":[31],"message-passing":[32],"(IMP)":[33],"decoders.":[34,333],"So":[35],"far,":[36],"most":[37,86],"systematic":[38],"studies":[39,84],"IMP":[41,64,112,144,157,332],"decoders":[42],"focused":[44],"on":[45,120,347],"evaluating":[46],"average":[48],"performance":[49],"random":[51],"ensembles":[52],"LDPC":[54],"infinite":[57],"length.":[58],"However,":[59],"statistical":[61],"nature":[62,131],"algorithms":[65],"does":[66],"not":[67],"seem":[68],"suitable":[70],"for":[71,82,272,316,324],"rigorous":[72],"analysis":[73,142],"decoding":[75,97,117,124,151,248,274,290,328],"individual":[77],"finite-length":[78,83,141],"codes.":[79],"The":[80,129],"need":[81],"are":[85,270],"critical":[87],"in":[88,167,222,293,335],"applications":[89],"such":[90],"as":[91],"data":[92],"storage,":[93],"where":[94,206],"required":[96],"error":[98],"rate":[99],"is":[100,118,152,210,231],"too":[101],"low":[102],"be":[104,322],"verifiable":[105],"simulation.":[107],"As":[108],"an":[109,200,238,286],"alternative":[110],"algorithms,":[113],"linear":[114,127,291,308],"programming":[115],"(LP)":[116],"based":[119],"relaxing":[121,301],"optimal":[123,303],"into":[125,306],"a":[126,213,223,234,253,307,312,336],"optimization.":[128],"geometric":[130],"this":[133,181],"approach":[134,256,288],"makes":[135],"more":[137,154],"amenable":[138],"deterministic":[140],"than":[143,156],"decoding.":[145,264],"On":[146],"other":[148],"hand,":[149],"LP":[150,178,188,204,240,263,273,330],"computationally":[153],"complex":[155],"decoding,":[158,189,205],"due":[159],"both":[161],"large":[163],"number":[164],"constraints":[166],"relaxed":[169,208],"problem,":[170],"and":[171,275,327],"inefficiency":[173],"using":[175],"general":[176],"-purpose":[177],"solvers.":[179],"In":[180],"dissertation,":[182],"we":[183,310,341],"study":[184,342],"several":[185,268],"aspects":[186],"starting":[190],"some":[192],"steps":[193],"toward":[194],"reducing":[195],"its":[196,276],"complexity.":[197],"We":[198,250,279],"introduce":[199],"adaptive":[201],"implementation":[202,236],"problem":[209,305],"replaced":[211],"sequence":[214],"subproblems":[216],"much":[218],"smaller":[219],"size,":[220],"resulting":[221],"complexity":[224],"reduction":[225],"orders":[227],"magnitude.":[229],"This":[230],"followed":[232],"sparse":[235],"interior-point":[239],"solver":[241],"exploits":[243],"structure":[245],"problem.":[249],"further":[251],"propose":[252],"cutting-":[254],"plane":[255],"improve":[258],"error-correcting":[260],"capability":[261],"Along":[265],"way,":[267],"properties":[269],"proved":[271],"proposed":[277],"variations.":[278],"continue":[280],"investigating":[282],"application":[284],"optimization-based":[287],"presence":[295],"intersymbol":[297],"interference":[298],"(ISI).":[299],"By":[300],"detection":[304],"program,":[309],"derive":[311],"new":[313],"graphical":[314],"representation":[315],"ISI":[318],"channel,":[319],"can":[321],"used":[323],"combined":[325],"equalization":[326],"or":[331],"Finally,":[334],"separate":[337],"piece":[338],"work,":[340],"effect":[344],"nonlinearities":[346],"multiuser":[349],"optical":[352],"fibers":[353]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}