{"id":"https://openalex.org/W2143579137","doi":"https://doi.org/10.1109/isit.2007.4557103","title":"Algebraic Superposition of LDGM Codes for Cooperative Diversity","display_name":"Algebraic Superposition of LDGM Codes for Cooperative Diversity","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2143579137","doi":"https://doi.org/10.1109/isit.2007.4557103","mag":"2143579137"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5101458457","display_name":"Lei Xiao","orcid":"https://orcid.org/0000-0003-4985-8633"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lei Xiao","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: lxiao@nd.edu Tel: 574 631-7244","Univ. of Notre Dame Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: lxiao@nd.edu Tel: 574 631-7244","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Univ. of Notre Dame Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002338945","display_name":"Thomas E. Fuja","orcid":"https://orcid.org/0000-0003-0026-8499"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas E. Fuja","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: tfuja@nd.edu Tel: 574 631-7244","Univ. of Notre Dame Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: tfuja@nd.edu Tel: 574 631-7244","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Univ. of Notre Dame Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: jkliewer@nd.edu Tel: 574 631-7244","Univ. of Notre Dame Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: jkliewer@nd.edu Tel: 574 631-7244","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Univ. of Notre Dame Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: costello.2@nd.edu Tel: 574 631-7244","Univ. of Notre Dame Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. Email: costello.2@nd.edu Tel: 574 631-7244","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Univ. of Notre Dame Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0211,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88293399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"676","last_page":"680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9965000152587891,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9922999739646912,"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/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6922383904457092},{"id":"https://openalex.org/keywords/generator-matrix","display_name":"Generator matrix","score":0.6823655962944031},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6303951740264893},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5552143454551697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5464372634887695},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5269725322723389},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.49988675117492676},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.46933192014694214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4607594609260559},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44391822814941406},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4250474274158478},{"id":"https://openalex.org/keywords/algebraic-structure","display_name":"Algebraic structure","score":0.4103237986564636},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.33140599727630615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3243858814239502}],"concepts":[{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6922383904457092},{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.6823655962944031},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6303951740264893},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5552143454551697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5464372634887695},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5269725322723389},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.49988675117492676},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.46933192014694214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4607594609260559},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44391822814941406},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4250474274158478},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.4103237986564636},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.33140599727630615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3243858814239502},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2098480381","https://openalex.org/W2110193293","https://openalex.org/W2113286945","https://openalex.org/W2118702395","https://openalex.org/W2130347036","https://openalex.org/W2135764410","https://openalex.org/W2148963518","https://openalex.org/W2149718704","https://openalex.org/W2150733216","https://openalex.org/W2151865945","https://openalex.org/W2152050697","https://openalex.org/W2152121970","https://openalex.org/W2158562094","https://openalex.org/W2160390925","https://openalex.org/W2164580880","https://openalex.org/W2748234758","https://openalex.org/W6676333889","https://openalex.org/W6682266006","https://openalex.org/W6683533145","https://openalex.org/W7019987040"],"related_works":["https://openalex.org/W2134727924","https://openalex.org/W1848770611","https://openalex.org/W2105454578","https://openalex.org/W1520296533","https://openalex.org/W2123798617","https://openalex.org/W1593765610","https://openalex.org/W2114200087","https://openalex.org/W1874908784","https://openalex.org/W2146655154","https://openalex.org/W190540493"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,22,26,51,57,62,96],"technique":[4],"for":[5,60,70],"achieving":[6],"cooperative":[7,63],"spatial":[8,39],"diversity":[9,40,64],"using":[10,84],"serially":[11],"concatenated":[12],"low":[13,99],"density":[14],"generator":[15,53],"matrix":[16,54],"(LDGM)":[17],"codes.":[18],"Specifically,":[19],"we":[20],"consider":[21],"scenario":[23],"in":[24],"which":[25],"pair":[27],"of":[28,33,47,87],"transceivers":[29],"employ":[30],"algebraic":[31,85],"superposition":[32,86],"error":[34,106],"control":[35],"codes":[36,49,73,89],"to":[37],"effect":[38],"at":[41,77],"their":[42],"common":[43],"destination.":[44],"The":[45,66,93],"construction":[46],"LDGM":[48],"from":[50],"sparse":[52],"makes":[55],"them":[56],"natural":[58],"fit":[59],"such":[61],"scheme.":[65],"simple":[67],"decoder":[68],"structure":[69],"graph":[71],"based":[72],"reduces":[74],"the":[75,78],"complexity":[76,103],"destination":[79],"compared":[80],"with":[81,98],"previously-proposed":[82],"schemes":[83],"convolutional":[88],"and":[90,101,104],"turbo-like":[91],"decoding.":[92],"result":[94],"is":[95],"system":[97],"encoding":[100],"decoding":[102],"improved":[105],"performance.":[107]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}