{"id":"https://openalex.org/W2146459618","doi":"https://doi.org/10.1109/dcc.2004.1281475","title":"Design of Slepian-Wolf codes by channel code partitioning","display_name":"Design of Slepian-Wolf codes by channel code partitioning","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2146459618","doi":"https://doi.org/10.1109/dcc.2004.1281475","mag":"2146459618"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","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/A5048091865","display_name":"Vladimir Stankovi\u0107","orcid":"https://orcid.org/0000-0002-1075-2420"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Stankovic","raw_affiliation_strings":["Electrical Engineering Department, Texas A and M University, College Station, TX, USA","Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003197230","display_name":"A.D. Liveris","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.D. Liveris","raw_affiliation_strings":["Electrical Engineering Department, Texas A and M University, College Station, TX, USA","Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058154161","display_name":"Zixiang Xiong","orcid":"https://orcid.org/0000-0002-4714-3311"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zixiang Xiong","raw_affiliation_strings":["Electrical Engineering Department, Texas A and M University, College Station, TX, USA","Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007060246","display_name":"C.N. Georghiades","orcid":"https://orcid.org/0000-0001-8333-1638"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C.N. Georghiades","raw_affiliation_strings":["Electrical Engineering Department, Texas A and M University, College Station, TX, USA","Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.8501,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.98732058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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.9998000264167786,"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/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/T11321","display_name":"Error Correcting Code Techniques","score":0.9980999827384949,"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/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.7118015289306641},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6885543465614319},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.6355626583099365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6255775094032288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5870169997215271},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5661698579788208},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.5079439282417297},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.48768460750579834},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.4833252429962158},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.48048844933509827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47753632068634033},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45815858244895935},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.45356178283691406},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.43349355459213257},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.413490355014801},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35609740018844604},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3224782943725586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2722042202949524},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15251854062080383},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08528867363929749}],"concepts":[{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.7118015289306641},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6885543465614319},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.6355626583099365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6255775094032288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5870169997215271},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5661698579788208},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.5079439282417297},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.48768460750579834},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.4833252429962158},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.48048844933509827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47753632068634033},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45815858244895935},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.45356178283691406},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.43349355459213257},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.413490355014801},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35609740018844604},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3224782943725586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2722042202949524},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15251854062080383},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08528867363929749},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/dcc.2004.1281475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:strathprints.strath.ac.uk:38224","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/38224/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"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":"NonPeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334840","display_name":"Fonds pour la Formation \u00e0 la Recherche dans l\u2019Industrie et dans l\u2019Agriculture","ror":"https://ror.org/03q83t159"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W54685849","https://openalex.org/W1493541001","https://openalex.org/W1506669495","https://openalex.org/W1751403013","https://openalex.org/W1868552688","https://openalex.org/W2037478555","https://openalex.org/W2068143054","https://openalex.org/W2080257599","https://openalex.org/W2095812090","https://openalex.org/W2099213070","https://openalex.org/W2105768002","https://openalex.org/W2113222961","https://openalex.org/W2119677726","https://openalex.org/W2121606987","https://openalex.org/W2127185914","https://openalex.org/W2142521365","https://openalex.org/W2146963604","https://openalex.org/W2148398176","https://openalex.org/W2148874328","https://openalex.org/W2155676967","https://openalex.org/W2562965985","https://openalex.org/W2987657883","https://openalex.org/W3216977419","https://openalex.org/W4285719527","https://openalex.org/W6602243204","https://openalex.org/W6629343882"],"related_works":["https://openalex.org/W2694787941","https://openalex.org/W2138256990","https://openalex.org/W2554094894","https://openalex.org/W2572458422","https://openalex.org/W2017526706","https://openalex.org/W2038580206","https://openalex.org/W2139746419","https://openalex.org/W1574790520","https://openalex.org/W2890340439","https://openalex.org/W2146459618"],"abstract_inverted_index":{"A":[0],"Slepian-Wolf":[1,37,78,142,186],"coding":[2,38,111,152],"scheme":[3,68],"that":[4,69,93,129],"can":[5,107],"achieve":[6],"arbitrary":[7],"rate":[8],"allocation":[9],"among":[10,99],"two":[11,153],"encoders":[12],"was":[13],"outlined":[14],"in":[15,115,181],"the":[16,77,86,100,113,121,124,127,131,134,137,141,178],"work":[17],"of":[18,72,85,126],"Pradhan":[19],"and":[20,47,61,91,117,147,184],"Ramchandran.":[21],"Inspired":[22],"by":[23,164],"this":[24],"work,":[25],"we":[26,64,169],"start":[27],"with":[28,49,161],"a":[29,42,66,95,102,165],"detailed":[30],"solution":[31],"for":[32,94,110,151],"general":[33],"(asymmetric":[34],"or":[35],"symmetric)":[36],"based":[39],"on":[40,76],"partitioning":[41],"single":[43,103],"systematic":[44,59,145],"channel":[45,55,105,128],"code,":[46],"continue":[48],"practical":[50,104],"code":[51,106,122],"designs":[52],"using":[53,58],"advanced":[54],"codes.":[56],"By":[57],"IRA":[60,146],"turbo":[62,149],"codes,":[63],"devise":[65],"powerful":[67],"is":[70],"capable":[71],"approaching":[73],"any":[74],"point":[75],"bound.":[79],"We":[80],"further":[81],"study":[82],"an":[83],"extension":[84],"technique":[87],"to":[88],"multiple":[89],"sources,":[90,101,135,155],"show":[92],"particular":[96],"correlation":[97,132,162],"model":[98],"be":[108],"designed":[109],"all":[112],"sources":[114],"symmetric":[116,167,183],"asymmetric":[118,185],"scenarios.":[119],"If":[120],"approaches":[123],"capacity":[125],"models":[130],"between":[133],"then":[136],"system":[138],"will":[139],"approach":[140],"limit.":[143],"Using":[144],"punctured":[148],"codes":[150],"binary":[154,166],"each":[156],"being":[157],"independent":[158],"identically":[159],"distributed,":[160],"modeled":[163],"channel,":[168],"obtain":[170],"results":[171],"which":[172],"are":[173],"0.04":[174],"bits":[175],"away":[176],"from":[177],"theoretical":[179],"limit":[180],"both":[182],"settings.":[187]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}