{"id":"https://openalex.org/W2144860006","doi":"https://doi.org/10.1109/twc.2006.1673087","title":"On LDPC codes over channels with memory","display_name":"On LDPC codes over channels with memory","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2144860006","doi":"https://doi.org/10.1109/twc.2006.1673087","mag":"2144860006"},"language":"en","primary_location":{"id":"doi:10.1109/twc.2006.1673087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2006.1673087","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Wireless Communications","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/A5078307012","display_name":"Giulio Colavolpe","orcid":"https://orcid.org/0000-0002-0577-8626"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Colavolpe","raw_affiliation_strings":["Dipartimento di Ingegneria dell Informazione, Universita di Parma, Parma, Italy","Dipartimento di Ingegneria dell'Informazione, Univ. di Parma"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell Informazione, Universita di Parma, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Dipartimento di Ingegneria dell'Informazione, Univ. di Parma","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078307012"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":null,"apc_paid":null,"fwci":4.225,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.94756626,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"5","issue":"7","first_page":"1757","last_page":"1766"},"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.9986000061035156,"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.9962000250816345,"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/factor-graph","display_name":"Factor graph","score":0.8868504762649536},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7795127034187317},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6422328352928162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5975624918937683},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5150296688079834},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.463552862405777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4583546221256256},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.45713600516319275},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.45029374957084656},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.42904597520828247},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.34314438700675964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31366485357284546},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07527428865432739}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.8868504762649536},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7795127034187317},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6422328352928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5975624918937683},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5150296688079834},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.463552862405777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4583546221256256},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.45713600516319275},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.45029374957084656},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.42904597520828247},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34314438700675964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31366485357284546},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07527428865432739},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/twc.2006.1673087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2006.1673087","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Wireless Communications","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":64,"referenced_works":["https://openalex.org/W1548411822","https://openalex.org/W1561866930","https://openalex.org/W1562979145","https://openalex.org/W1953299273","https://openalex.org/W1985593155","https://openalex.org/W2026129786","https://openalex.org/W2029712200","https://openalex.org/W2044414088","https://openalex.org/W2045407304","https://openalex.org/W2075644649","https://openalex.org/W2080550094","https://openalex.org/W2080918425","https://openalex.org/W2091772845","https://openalex.org/W2092497635","https://openalex.org/W2097409422","https://openalex.org/W2098257210","https://openalex.org/W2100016874","https://openalex.org/W2100239053","https://openalex.org/W2101526122","https://openalex.org/W2102251435","https://openalex.org/W2102888884","https://openalex.org/W2104173222","https://openalex.org/W2106233680","https://openalex.org/W2107959360","https://openalex.org/W2108700799","https://openalex.org/W2110449509","https://openalex.org/W2111194581","https://openalex.org/W2115104320","https://openalex.org/W2115911436","https://openalex.org/W2120162479","https://openalex.org/W2121031454","https://openalex.org/W2122373822","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2129362928","https://openalex.org/W2134700719","https://openalex.org/W2134938338","https://openalex.org/W2135764410","https://openalex.org/W2135786262","https://openalex.org/W2136489515","https://openalex.org/W2137813581","https://openalex.org/W2142247420","https://openalex.org/W2146003884","https://openalex.org/W2146190320","https://openalex.org/W2146318236","https://openalex.org/W2148643041","https://openalex.org/W2149959899","https://openalex.org/W2151255971","https://openalex.org/W2151961505","https://openalex.org/W2153903821","https://openalex.org/W2154756387","https://openalex.org/W2154914664","https://openalex.org/W2156434076","https://openalex.org/W2157461771","https://openalex.org/W2157838670","https://openalex.org/W2158514560","https://openalex.org/W2165942867","https://openalex.org/W2169054930","https://openalex.org/W2169732368","https://openalex.org/W2170497750","https://openalex.org/W2172031920","https://openalex.org/W2498857583","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2107666555","https://openalex.org/W2743882049","https://openalex.org/W1650655882","https://openalex.org/W2188716532","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2011293233","https://openalex.org/W2964114570","https://openalex.org/W2167124952"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,6,46,71,192,224,262,277,279,285],"detection":[3,129,246],"and":[4,35,41,94,160,265,287],"decoding":[5],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10,159],"transmitted":[11,75],"over":[12],"channels":[13,290],"with":[14],"memory":[15,208],"is":[16,39,100,114,130,177,199,218,247],"addressed.":[17],"A":[18],"new":[19],"general":[20,179,201],"method":[21],"to":[22,51,68,106,116,157],"build":[23],"a":[24,43,54,72,77,204,213],"factor":[25,82,86,109,171,183,197,263],"graph":[26],"which":[27],"takes":[28],"into":[29,89],"account":[30,90],"both":[31],"the":[32,36,42,47,63,69,80,91,96,103,107,112,117,123,134,146,164,169,173,186,190,193,227,234,242,251,255,260,266,280,283],"code":[33,74,97],"constraints":[34],"channel":[37,92,113,207,235],"behavior":[38,93],"proposed":[40,148],"posteriori":[44,55],"probabilities":[45],"information":[48],"symbols,":[49],"necessary":[50],"implement":[52],"maximum":[53],"(MAP)":[56],"symbol":[57,139],"detection,":[58],"are":[59,291],"derived":[60,81,170],"by":[61,249],"using":[62,250],"sum-product":[64,165,267],"algorithm.":[65],"With":[66],"respect":[67],"case":[70],"LDPC":[73,158],"on":[76,168],"memoryless":[78],"channel,":[79],"graphs":[83,264],"have":[84],"additional":[85],"nodes":[87,184,198],"taking":[88],"not":[95,239],"constraints.":[98],"It":[99],"shown":[101],"that":[102,144,180,259],"function":[104],"associated":[105],"generic":[108],"node":[110],"modeling":[111,185],"related":[115],"basic":[118],"branch":[119],"metric":[120],"used":[121],"in":[122,133,178,200,203,233,241],"Viterbi":[124,252],"algorithm":[125,136,166,253,268],"when":[126,245],"MAP":[127,138],"sequence":[128],"applied":[131],"or":[132,254],"BCJR":[135,256],"implementing":[137],"detection.":[140,162],"This":[141,237],"fact":[142],"suggests":[143],"all":[145],"previously":[147],"solutions":[149],"for":[150,215],"those":[151],"algorithms":[152],"can":[153],"be":[154,270],"systematically":[155],"extended":[156],"graph-based":[161],"When":[163],"works":[167],"graphs,":[172],"most":[174],"demanding":[175],"computation":[176,194],"performed":[181,248],"at":[182,195],"channel.":[187],"In":[188,210,220],"fact,":[189],"complexity":[191,216,230],"these":[196,211],"exponential":[202],"suitably":[205],"defined":[206],"parameter.":[209],"cases,":[212],"technique":[214],"reduction":[217],"illustrated.":[219],"some":[221],"particular":[222],"cases":[223,244,284],"practical":[225],"relevance,":[226],"above":[228],"mentioned":[229],"becomes":[231],"linear":[232],"memory.":[236],"does":[238],"happen":[240],"same":[243],"algorithm,":[257],"suggesting":[258],"use":[261],"might":[269],"computationally":[271],"more":[272],"appealing.":[273],"As":[274],"an":[275],"example":[276],"application":[278],"described":[281],"framework,":[282],"noncoherent":[286],"flat":[288],"fading":[289],"considered":[292]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}