{"id":"https://openalex.org/W2088978568","doi":"https://doi.org/10.1109/tit.2013.2265693","title":"Graphical Characterizations of Linear Programming Pseudocodewords for Cycle Codes","display_name":"Graphical Characterizations of Linear Programming Pseudocodewords for Cycle Codes","publication_year":2013,"publication_date":"2013-07-11","ids":{"openalex":"https://openalex.org/W2088978568","doi":"https://doi.org/10.1109/tit.2013.2265693","mag":"2088978568"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2265693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2265693","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5087713664","display_name":"Nathan Axvig","orcid":null},"institutions":[{"id":"https://openalex.org/I114526571","display_name":"Concordia College - Minnesota","ror":"https://ror.org/00ppb2x90","country_code":"US","type":"education","lineage":["https://openalex.org/I114526571"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Axvig","raw_affiliation_strings":["Concordia College Moorhead, Moorhead, MN, US","Dept. of Math., Concordia Coll., Moorhead, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Concordia College Moorhead, Moorhead, MN, US","institution_ids":["https://openalex.org/I114526571"]},{"raw_affiliation_string":"Dept. of Math., Concordia Coll., Moorhead, MN, USA","institution_ids":["https://openalex.org/I114526571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042106103","display_name":"Deanna Dreher","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deanna Dreher","raw_affiliation_strings":["Department of Mathematics, University of Nebraska-Lincoln, Lincoln, NE, USA","University of Nebraska Lincoln, Lincoln, NE, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"University of Nebraska Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.366,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.67641396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"9","first_page":"5917","last_page":"5934"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9975000023841858,"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.9968000054359436,"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/linear-programming","display_name":"Linear programming","score":0.7960711717605591},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.535076379776001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5066290497779846},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4966602921485901},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4938562512397766},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.4424405097961426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3844633996486664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3795299530029297},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3392750024795532},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.06711074709892273}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7960711717605591},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.535076379776001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5066290497779846},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4966602921485901},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4938562512397766},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4424405097961426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3844633996486664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3795299530029297},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3392750024795532},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.06711074709892273},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/tit.2013.2265693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2265693","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W6426808","https://openalex.org/W7241855","https://openalex.org/W34792075","https://openalex.org/W333967823","https://openalex.org/W1586499344","https://openalex.org/W1588943481","https://openalex.org/W1595640491","https://openalex.org/W1762430620","https://openalex.org/W1974811277","https://openalex.org/W1991706950","https://openalex.org/W2033546746","https://openalex.org/W2035309551","https://openalex.org/W2068136251","https://openalex.org/W2068370657","https://openalex.org/W2101011172","https://openalex.org/W2116815462","https://openalex.org/W2135573812","https://openalex.org/W2141975070","https://openalex.org/W2142414818","https://openalex.org/W2167734735","https://openalex.org/W2169134868","https://openalex.org/W2532468848","https://openalex.org/W4300188436","https://openalex.org/W6635197353"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W3182682721","https://openalex.org/W4386394964","https://openalex.org/W2080462934","https://openalex.org/W90125000","https://openalex.org/W2053271671","https://openalex.org/W3111705864","https://openalex.org/W1495965042","https://openalex.org/W2261561465","https://openalex.org/W1512175223"],"abstract_inverted_index":{"The":[0,16,102],"performance":[1,36,144],"of":[2,11,19,22,34,37,55,74,78,88,97,104,117,128,145,181],"linear":[3,13,23,43,58,75,89,99,125,147],"programming":[4,14,24,44,59,76,90,100,126,148],"decoding":[5],"is":[6,26,107,135,184],"determined":[7],"by":[8],"the":[9,35,42,52,85,95,114,133,142,146,155,162],"set":[10,21,87,96],"nonzero":[12],"pseudocodewords.":[15,101],"minimum":[17,115],"pseudoweight":[18],"this":[20,69],"pseudocodewords":[25,60,77],"also":[27],"generally":[28],"accepted":[29],"as":[30],"a":[31,47,56,65,111,118,124,129,139,167],"good":[32],"predictor":[33],"iterative":[38],"message-passing":[39],"decoding.":[40],"Since":[41],"decoder":[45,149],"has":[46],"natural":[48],"description":[49],"based":[50],"on":[51],"Tanner":[53],"graph":[54,119],"code,":[57,131],"can":[61],"be":[62],"analyzed":[63],"from":[64],"graphical":[66,72],"viewpoint.":[67],"In":[68],"paper,":[70],"two":[71,171],"characterizations":[73,106,172],"cycle":[79,130],"codes":[80],"are":[81],"provided:":[82],"one":[83,93],"for":[84,94,113],"entire":[86],"pseudocodewords,":[91],"and":[92,132,177],"minimal":[98],"first":[103],"these":[105,170],"used":[108,136],"to":[109,122,137],"determine":[110],"formula":[112],"degree":[116],"cover":[120],"necessary":[121],"realize":[123],"pseudocodeword":[127],"second":[134],"prove":[138],"result":[140],"concerning":[141],"asymptotic":[143],"when":[150],"considering":[151],"transmission":[152],"over":[153],"either":[154],"additive":[156],"white":[157],"Gaussian":[158],"noise":[159],"channel":[160],"or":[161],"binary":[163],"symmetric":[164],"channel.":[165],"Finally,":[166],"discussion":[168],"contrasting":[169],"both":[173],"with":[174,178],"each":[175],"other":[176],"Horn's":[179],"characterization":[180],"bad":[182],"pseudocycles":[183],"provided.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}