{"id":"https://openalex.org/W2577079242","doi":"https://doi.org/10.1109/isit.2017.8006798","title":"Generalized approximate message-passing decoder for universal sparse superposition codes","display_name":"Generalized approximate message-passing decoder for universal sparse superposition codes","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2577079242","doi":"https://doi.org/10.1109/isit.2017.8006798","mag":"2577079242"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006798","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.03590","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Erdem Biyik","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Erdem Biyik","raw_affiliation_strings":["Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jean Barbier","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jean Barbier","raw_affiliation_strings":["Communication Theory Laboratory, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mohamad Dia","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mohamad Dia","raw_affiliation_strings":["Communication Theory Laboratory, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication Theory Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1593","last_page":"1597"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T10148","display_name":"Advanced MIMO Systems Optimization","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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6377999782562256},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.5859000086784363},{"id":"https://openalex.org/keywords/superposition-principle","display_name":"Superposition principle","score":0.44780001044273376},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.44519999623298645},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.4397999942302704},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.43709999322891235},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4293999969959259},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.42340001463890076},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.3995000123977661}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6389999985694885},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6377999782562256},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5859000086784363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5389000177383423},{"id":"https://openalex.org/C27753989","wikidata":"https://www.wikidata.org/wiki/Q284885","display_name":"Superposition principle","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.4397999942302704},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.3995000123977661},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39879998564720154},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.39800000190734863},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36489999294281006},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.33149999380111694},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3255999982357025},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.299699991941452},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.27619999647140503},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.25279998779296875},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.25099998712539673}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2017.8006798","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1701.03590","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.03590","pdf_url":"https://arxiv.org/pdf/1701.03590","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/37618","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/37618","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE International Symposium on Information Theory - Proceedings","raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.03590","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.03590","pdf_url":"https://arxiv.org/pdf/1701.03590","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5256785375","display_name":null,"funder_award_id":"200021-","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5941751334","display_name":"Spatial Coupling of Graphical Models in Communications, Signal Processing, Computer Science and Statistical Physics","funder_award_id":"156672","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7160048158","display_name":null,"funder_award_id":"200021-156672","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2018322127","https://openalex.org/W2039957496","https://openalex.org/W2079476915","https://openalex.org/W2082029531","https://openalex.org/W2088934832","https://openalex.org/W2092639489","https://openalex.org/W2129857026","https://openalex.org/W2179644698","https://openalex.org/W2182574341","https://openalex.org/W2483978192","https://openalex.org/W2610971674","https://openalex.org/W2963072996","https://openalex.org/W2963604059","https://openalex.org/W2963639053","https://openalex.org/W2964071011"],"related_works":[],"abstract_inverted_index":{"Sparse":[0],"superposition":[1],"(SS)":[2],"codes":[3,28,154],"were":[4],"originally":[5],"proposed":[6],"as":[7],"a":[8,117,140,160],"capacity-achieving":[9],"communication":[10,77],"scheme":[11,78],"over":[12,38],"the":[13,32,64,73,88,95,100,105,114,124,132,150,165,171],"additive":[14],"white":[15],"Gaussian":[16],"noise":[17],"channel":[18,41],"(AWGNC)":[19],"[1].":[20],"Very":[21],"recently,":[22],"it":[23],"was":[24],"discovered":[25],"that":[26,34,112,134],"these":[27],"are":[29],"universal,":[30],"in":[31,139,147,164],"sense":[33],"they":[35],"achieve":[36],"capacity":[37,138],"any":[39],"memoryless":[40],"under":[42],"generalized":[43],"approximate":[44],"message-passing":[45],"(GAMP)":[46],"decoding":[47],"[2],":[48],"although":[49],"this":[50,60,76],"decoder":[51,66],"has":[52],"never":[53],"been":[54],"stated":[55],"for":[56,67,155,178],"SS":[57,68,153],"codes.":[58],"In":[59],"contribution":[61],"we":[62,70,86],"introduce":[63],"GAMP":[65,103,121],"codes,":[69],"confirm":[71],"empirically":[72,110],"universality":[74],"of":[75,102,116,167,173],"through":[79],"its":[80],"study":[81],"on":[82],"various":[83],"channels":[84,158],"and":[85,94],"provide":[87],"main":[89],"analysis":[90],"tools:":[91],"state":[92],"evolution":[93],"potential.":[96],"We":[97,109,143],"also":[98,144],"compare":[99],"performance":[101,133,172],"with":[104,149],"Bayes-optimal":[106],"MMSE":[107],"decoder.":[108],"illustrate":[111],"despite":[113],"presence":[115],"phase":[118],"transition":[119],"preventing":[120],"to":[122,130,137],"reach":[123],"optimal":[125],"performance,":[126],"spatial":[127],"coupling":[128],"allows":[129],"boost":[131],"eventually":[135],"tends":[136],"proper":[141],"limit.":[142],"prove":[145],"that,":[146],"contrast":[148],"AWGNC":[151],"case,":[152],"binary":[156],"input":[157],"have":[159],"vanishing":[161],"error":[162],"floor":[163],"limit":[166],"large":[168],"codewords.":[169],"Moreover,":[170],"Hadamard-based":[174],"encoders":[175],"is":[176],"assessed":[177],"practical":[179],"implementations.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2017-01-26T00:00:00"}