{"id":"https://openalex.org/W2107271514","doi":"https://doi.org/10.1109/glocom.2004.1377911","title":"A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding","display_name":"A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W2107271514","doi":"https://doi.org/10.1109/glocom.2004.1377911","mag":"2107271514"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2004.1377911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1377911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5006031902","display_name":"Ruiyuan Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruiyuan Hu","raw_affiliation_strings":["Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039621377","display_name":"R. Viswanathan","orcid":"https://orcid.org/0000-0002-9495-8804"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Viswanathan","raw_affiliation_strings":["Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100336996","display_name":"Jing Li","orcid":"https://orcid.org/0000-0002-7977-103X"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jing Li","raw_affiliation_strings":["Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Electr. & Comput. Eng. Dept, Lehigh Univ., Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"51","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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.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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"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/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.797828733921051},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7500073909759521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7375650405883789},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6183679699897766},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.5778552889823914},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.5186237692832947},{"id":"https://openalex.org/keywords/joint","display_name":"Joint (building)","score":0.4810662269592285},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.47452107071876526},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.46402624249458313},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.45103204250335693},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.44249486923217773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33849725127220154},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.2284298539161682},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17699629068374634},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07172700762748718}],"concepts":[{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.797828733921051},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7500073909759521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7375650405883789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6183679699897766},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.5778552889823914},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.5186237692832947},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.4810662269592285},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.47452107071876526},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.46402624249458313},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.45103204250335693},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.44249486923217773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33849725127220154},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.2284298539161682},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17699629068374634},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07172700762748718},{"id":"https://openalex.org/C170154142","wikidata":"https://www.wikidata.org/wiki/Q150737","display_name":"Architectural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/glocom.2004.1377911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1377911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.8121","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.8121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.lehigh.edu/~jingli/pub/paper/GLBCOM2004_dsc_LDPC.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.5645","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.5645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.lehigh.edu/~jingli/pub/paper/GLBCOM2004_dsc_LDPC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.47999998927116394,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1547410848","https://openalex.org/W1571565904","https://openalex.org/W1574790520","https://openalex.org/W1597749830","https://openalex.org/W1815900701","https://openalex.org/W1868552688","https://openalex.org/W1893527049","https://openalex.org/W2080257599","https://openalex.org/W2098945506","https://openalex.org/W2099213070","https://openalex.org/W2105323393","https://openalex.org/W2107028867","https://openalex.org/W2111992817","https://openalex.org/W2138256990","https://openalex.org/W2142521365","https://openalex.org/W2146963604","https://openalex.org/W2148398176","https://openalex.org/W2157324791","https://openalex.org/W6634121476","https://openalex.org/W6639539968","https://openalex.org/W6676292322"],"related_works":["https://openalex.org/W1972318883","https://openalex.org/W2534582423","https://openalex.org/W2121305283","https://openalex.org/W1944343091","https://openalex.org/W2015741799","https://openalex.org/W2168862745","https://openalex.org/W3114701954","https://openalex.org/W1603044377","https://openalex.org/W1996737726","https://openalex.org/W74052680"],"abstract_inverted_index":{"A":[0,44],"new":[1],"scheme":[2,71],"for":[3],"solving":[4],"the":[5,41,53,60,66,89,93,101,104],"Slepian-Wolf":[6],"problem":[7],"over":[8],"noisy":[9],"channels":[10],"using":[11],"serially":[12],"concatenated":[13,106],"codes":[14],"is":[15,24,50,57,72],"proposed.":[16],"An":[17],"outer":[18,62],"low":[19,120],"density":[20],"parity":[21],"check":[22],"code":[23,35],"used":[25],"to":[26,40,59],"perform":[27],"distributed":[28],"source":[29],"coding,":[30],"and":[31,82,92,96],"an":[32],"inner":[33,68],"convolutional":[34],"adds":[36],"error":[37,83],"protecting":[38],"capability":[39],"compressed":[42],"data.":[43],"soft":[45],"iterative":[46,98],"joint":[47,97,115],"source-channel":[48],"decoder":[49,54,63],"performed,":[51],"where":[52],"side":[55],"information":[56],"provided":[58],"sub":[61,67],"instead":[64],"of":[65,77,103],"decoder.":[69],"The":[70],"attractive":[73],"since":[74],"separate":[75],"refining":[76],"compression":[78],"rate":[79],"(outer":[80],"code)":[81,87],"protection":[84],"power":[85,102],"(inner":[86],"makes":[88],"design":[90],"easy":[91],"performance":[94],"controllable,":[95],"decoding":[99,116],"exploits":[100],"serial":[105],"structure":[107],"as":[108,110],"much":[109],"possible.":[111],"Simulations":[112],"reveal":[113],"encouraging":[114],"gain":[117],"especially":[118],"at":[119],"signal-to-noise":[121],"ratios.":[122]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}