{"id":"https://openalex.org/W2963036798","doi":null,"title":"Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels","display_name":"Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W2963036798","mag":"2963036798"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.758.9276","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.758.9276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1403.4118.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2963036798"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9833999872207642,"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.9833999872207642,"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.014600000344216824,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.000699999975040555,"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/maximum-likelihood-decoding","display_name":"maximum likelihood decoding","score":0.9990000128746033},{"id":"https://openalex.org/keywords/linear-codes","display_name":"linear codes","score":1.0},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8420000076293945},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.7689999938011169},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.8399999737739563},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":0.890999972820282},{"id":"https://openalex.org/keywords/minimum-distance-computation","display_name":"minimum distance computation","score":0.5230000019073486},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"additive white Gaussian noise","score":0.7369999885559082},{"id":"https://openalex.org/keywords/decoding-complexity","display_name":"decoding complexity","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6978617310523987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6727559566497803},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.6101343631744385},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5929920673370361},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5321943759918213},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5038339495658875},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4552338421344757},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45006951689720154},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4432269036769867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4425668716430664},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.43160945177078247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40677914023399353},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4011298418045044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2443019151687622},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1490887701511383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13265177607536316},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11138027906417847},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.758.9276","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.758.9276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1403.4118.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W633194093","https://openalex.org/W1588943481","https://openalex.org/W1644601915","https://openalex.org/W1970755778","https://openalex.org/W2035929826","https://openalex.org/W2070021925","https://openalex.org/W2076838340","https://openalex.org/W2078633872","https://openalex.org/W2137813581","https://openalex.org/W2156660752","https://openalex.org/W2156826724","https://openalex.org/W2169134868","https://openalex.org/W3105799065","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2035895249","https://openalex.org/W394674862","https://openalex.org/W2145969665","https://openalex.org/W3156827709","https://openalex.org/W2892198099","https://openalex.org/W1905328716","https://openalex.org/W2287283634","https://openalex.org/W2280189816","https://openalex.org/W2948003872","https://openalex.org/W2155316710"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,118],"consider":[4],"efficient":[5],"maximum-likelihood":[6],"decoding":[7],"of":[8,27,93],"linear":[9],"block":[10,14],"codes":[11,58],"for":[12,36,55,63,72,90],"small-to-moderate":[13],"lengths.":[15],"The":[16],"presented":[17],"approach":[18,26,60],"is":[19,61,81],"a":[20,104],"branch-and-bound":[21],"algorithm":[22,45,80,108],"using":[23,127],"the":[24,47,73,97,114,128],"cutting-plane":[25],"Zhang":[28],"and":[29,54,66],"Siegel":[30],"(IEEE":[31],"Trans.":[32],"Inf.":[33],"Theory,":[34],"2012)":[35],"obtaining":[37],"lower":[38],"bounds.":[39],"We":[40],"have":[41,119],"compared":[42],"our":[43,59,79,107],"proposed":[44],"to":[46,112,122],"state-of-the-art":[48],"commercial":[49],"integer":[50],"program":[51],"solver":[52],"CPLEX,":[53],"all":[56],"considered":[57],"faster":[62,125],"both":[64],"low":[65],"high":[67],"signal-to-noise":[68],"ratios.":[69],"For":[70],"instance,":[71],"benchmark":[74],"(155,":[75],"64)":[76],"Tanner":[77],"code":[78],"more":[82],"than":[83,126],"11":[84],"times":[85],"as":[86,88],"fast":[87],"CPLEX":[89,129],"an":[91],"SNR":[92],"1.0":[94],"dB":[95],"on":[96],"additive":[98],"white":[99],"Gaussian":[100],"noise":[101],"channel.":[102],"By":[103],"small":[105],"modification,":[106],"can":[109],"be":[110,123],"used":[111],"calculate":[113],"minimum":[115],"distance,":[116],"which":[117],"again":[120],"verified":[121],"much":[124],"solver.":[130]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2963036798","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2019-07-30T00:00:00"}
