{"id":"https://openalex.org/W2097028065","doi":"https://doi.org/10.1109/isit.2011.6033873","title":"Algebraic codes for Slepian-Wolf code design","display_name":"Algebraic codes for Slepian-Wolf code design","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2097028065","doi":"https://doi.org/10.1109/isit.2011.6033873","mag":"2097028065"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"preprint","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/A5011617835","display_name":"Shizheng Li","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shizheng Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, 50011 USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3657,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6545654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1861","last_page":"1865"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9993000030517578,"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.9988999962806702,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8682582378387451},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7000788450241089},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5392723083496094},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5086318254470825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5014076232910156},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.46475234627723694},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.46079736948013306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45014670491218567},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.44664037227630615},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4324493408203125},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4206762909889221},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.39606818556785583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3403659164905548},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.16244959831237793}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8682582378387451},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7000788450241089},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5392723083496094},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5086318254470825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5014076232910156},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.46475234627723694},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.46079736948013306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45014670491218567},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.44664037227630615},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4324493408203125},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4206762909889221},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.39606818556785583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3403659164905548},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.16244959831237793},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2011.6033873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:lib.dr.iastate.edu:ece_conf-1022","is_oa":false,"landing_page_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1022&context=ece_conf","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electrical and Computer Engineering Conference Papers, Posters and Presentations","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.755.8387","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.8387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1106.2792.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1939981841","https://openalex.org/W2032431003","https://openalex.org/W2039182392","https://openalex.org/W2051388028","https://openalex.org/W2088214533","https://openalex.org/W2100852839","https://openalex.org/W2102860450","https://openalex.org/W2103353540","https://openalex.org/W2154270057","https://openalex.org/W2162404506"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W2127950068","https://openalex.org/W2150212378","https://openalex.org/W1851307089","https://openalex.org/W2209506458","https://openalex.org/W1580452828","https://openalex.org/W1996737726","https://openalex.org/W2383546851","https://openalex.org/W1917873986","https://openalex.org/W2020418355"],"abstract_inverted_index":{"Practical":[0],"constructions":[1],"of":[2,15,38,53,86,96,104,113,140,150,210,218,233,241,251,257,263],"lossless":[3],"distributed":[4],"source":[5],"codes":[6,31,49,99,115,127,152,162,188,195,206,235,253],"(for":[7],"the":[8,13,19,36,51,83,87,94,101,144,175,208,215,219,231,249,255,260,264],"Slepian-Wolf":[9,185],"problem)":[10],"have":[11,32],"been":[12,33],"subject":[14],"much":[16,267],"investigation":[17],"in":[18,82,183,207,254,259],"past":[20],"decade.":[21],"In":[22,89,124,227],"particular,":[23],"near-capacity":[24],"achieving":[25],"code":[26,170],"designs":[27,240],"based":[28],"on":[29],"LDPC":[30,161,169,194,205,242,273],"presented":[34],"for":[35,50,100],"case":[37,52,209],"two":[39],"binary":[40],"sources,":[41],"with":[42,56,143,155,238],"a":[43,65,138,223,228],"binary-symmetric":[44],"correlation.":[45],"However,":[46],"constructing":[47],"practical":[48,66],"non-binary":[54],"sources":[55,220,265],"arbitrary":[57],"correlation":[58,122,141,212],"remains":[59,78,135],"by":[60],"and":[61,132,157,192,200],"large":[62],"open.":[63],"From":[64],"perspective":[67],"it":[68],"is":[69,153,171,236,266],"also":[70,246],"interesting":[71],"to":[72,80,173,271],"consider":[73],"coding":[74],"schemes":[75],"whose":[76],"performance":[77,133,149,232,250],"robust":[79],"uncertainties":[81],"joint":[84,261],"distribution":[85,217,262],"sources.":[88],"this":[90,105],"work":[91],"we":[92],"propose":[93],"usage":[95],"Reed-Solomon":[97],"(RS)":[98],"asymmetric":[102],"version":[103],"problem.":[106],"We":[107],"show":[108,181],"that":[109,134,182,248],"algebraic":[110],"soft-decision":[111],"decoding":[112],"RS":[114,126,151,187,234,252],"can":[116],"be":[117],"used":[118,172],"effectively":[119],"under":[120,196],"certain":[121],"structures.":[123],"addition,":[125],"offer":[128],"natural":[129],"rate":[130,158],"adaptivity":[131],"constant":[136],"across":[137],"family":[139],"structures":[142],"same":[145],"conditional":[146,216],"entropy.":[147],"The":[148],"compared":[154,270],"dedicated":[156,191],"adaptive":[159],"multistage":[160,272],"(Varodayan":[163],"et":[164],"al.":[165],"'06),":[166],"where":[167,214],"each":[168],"compress":[174],"individual":[176],"bit":[177],"planes.":[178],"Our":[179,244],"simulations":[180,245],"classical":[184],"scenario,":[186,230],"outperform":[189],"both":[190,239],"rate-adaptive":[193,204],"q-ary":[197],"symmetric":[198],"correlation,":[199],"are":[201],"better":[202,268],"than":[203],"sparse":[211],"models,":[213],"has":[221],"only":[222],"few":[224],"dominant":[225],"entries.":[226],"feedback":[229],"comparable":[237],"codes.":[243,274],"demonstrate":[247],"presence":[256],"inaccuracies":[258],"as":[269]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}