{"id":"https://openalex.org/W2165241191","doi":"https://doi.org/10.1109/isit.2004.1365379","title":"Filling-in some of the decoding gap between belief propagation (BP) and maximum a posteriori (MAP) for convolutional codes","display_name":"Filling-in some of the decoding gap between belief propagation (BP) and maximum a posteriori (MAP) for convolutional codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2165241191","doi":"https://doi.org/10.1109/isit.2004.1365379","mag":"2165241191"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5103453163","display_name":"P.C. Massey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P.C. Massey","raw_affiliation_strings":["Park Ridge Handyman, Inc., South Bend, IN, USA"],"affiliations":[{"raw_affiliation_string":"Park Ridge Handyman, Inc., South Bend, IN, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103453163"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22150335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"342","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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.9994999766349792,"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.9988999962806702,"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/T11130","display_name":"Coding theory and cryptography","score":0.98089998960495,"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/decoding-methods","display_name":"Decoding methods","score":0.9247554540634155},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8121563196182251},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.8104507923126221},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.8095985651016235},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7535216808319092},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6645330786705017},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6637263894081116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6408966183662415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5277417302131653},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.49118492007255554},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4237365126609802},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4207553267478943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36915427446365356},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.31264519691467285},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.10898351669311523},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07105299830436707},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.06189817190170288}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.9247554540634155},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8121563196182251},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.8104507923126221},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.8095985651016235},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7535216808319092},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6645330786705017},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6637263894081116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6408966183662415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5277417302131653},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.49118492007255554},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4237365126609802},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4207553267478943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36915427446365356},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.31264519691467285},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.10898351669311523},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07105299830436707},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.06189817190170288},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":2,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W2045407304"],"related_works":["https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2118148379","https://openalex.org/W2135229457","https://openalex.org/W2944806087","https://openalex.org/W2355675923","https://openalex.org/W2135783484","https://openalex.org/W1978153242","https://openalex.org/W1983324765","https://openalex.org/W2159021452"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3,28],"iterative":[4],"method":[5,67],"of":[6],"decoding":[7,14,18,66,107],"(for":[8],"convolutional":[9],"codes)":[10],"that":[11,54,85],"obtains":[12],"soft-estimate":[13],"performances":[15],"in-between":[16],"BP":[17,36,63],"and":[19,43],"optimal":[20,72],"MAP":[21,73,106],"decoding.":[22,64],"The":[23,48,65,82],"idea":[24],"is":[25,33,50,84,103],"to":[26,76],"replace":[27],"original":[29],"even-parity":[30],"function":[31,42],"(which":[32],"used":[34],"in":[35],"decoding)":[37],"with":[38],"a":[39,44,51],"\"reduced\"":[40],"core":[41],"corresponding":[45],"multistate":[46],"trellis.":[47],"result":[49],"soft-decoding":[52],"performance":[53,60,74],"can":[55],"be":[56],"better":[57],"than":[58,93],"the":[59,71,79,86,94],"for":[61,105],"recursive":[62,80],"does":[68],"not":[69],"achieve":[70],"due":[75],"dependencies":[77],"within":[78],"algorithm.":[81],"benefit":[83],"trellis":[87,101],"may":[88],"have":[89],"far":[90],"fewer":[91],"states":[92],"full":[95],"2":[96],"<sup":[97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sup>":[99],"-state":[100],"which":[102],"required":[104]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}