{"id":"https://openalex.org/W2127185914","doi":"https://doi.org/10.1109/dcc.2003.1194010","title":"Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes","display_name":"Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes","publication_year":2003,"publication_date":"2003-11-04","ids":{"openalex":"https://openalex.org/W2127185914","doi":"https://doi.org/10.1109/dcc.2003.1194010","mag":"2127185914"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2003.1194010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2003.1194010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2003. Proceedings. DCC 2003","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/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":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.2737,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.98658898,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication 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/T10125","display_name":"Advanced Wireless Communication 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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"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.9997000098228455,"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/turbo-code","display_name":"Turbo code","score":0.7931743264198303},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.7566208839416504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.729845404624939},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.6922330856323242},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6182982325553894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5835475325584412},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5686249732971191},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.515468418598175},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.513799250125885},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.4426727294921875},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41994065046310425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3965539336204529},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.32900822162628174},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.2618878185749054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17672279477119446},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13912785053253174}],"concepts":[{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7931743264198303},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.7566208839416504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.729845404624939},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.6922330856323242},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6182982325553894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5835475325584412},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5686249732971191},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.515468418598175},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.513799250125885},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.4426727294921875},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41994065046310425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3965539336204529},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.32900822162628174},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.2618878185749054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17672279477119446},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13912785053253174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2003.1194010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2003.1194010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2003. Proceedings. DCC 2003","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1868552688","https://openalex.org/W2045896434","https://openalex.org/W2069925353","https://openalex.org/W2080257599","https://openalex.org/W2099213070","https://openalex.org/W2105768002","https://openalex.org/W2111992817","https://openalex.org/W2130876557","https://openalex.org/W2142521365","https://openalex.org/W2145714519","https://openalex.org/W2146963604","https://openalex.org/W2150412388","https://openalex.org/W2151650635","https://openalex.org/W2153770209","https://openalex.org/W2160517529"],"related_works":["https://openalex.org/W1996737726","https://openalex.org/W4239415679","https://openalex.org/W2126275884","https://openalex.org/W792671342","https://openalex.org/W2075640816","https://openalex.org/W2015101254","https://openalex.org/W4230255614","https://openalex.org/W1837854271","https://openalex.org/W1580452828","https://openalex.org/W190540493"],"abstract_inverted_index":{"It":[0],"is":[1,57,81],"shown":[2],"how":[3],"conventional":[4],"parallel":[5],"(turbo)":[6],"and":[7,66,71,95],"serial":[8],"concatenated":[9],"convolutional":[10],"codes":[11,30,94],"can":[12],"be":[13,84],"used":[14,32],"to":[15,18,29,83,97],"compress":[16],"close":[17,96],"the":[19,23,38,53,55,61,87,98],"Slepian-Wolf":[20,99],"limit":[21],"for":[22],"correlated":[24],"binary":[25,47],"sources.":[26],"Conventional":[27],"refers":[28],"already":[31],"in":[33,76],"channel":[34,65],"coding.":[35],"Focusing":[36],"on":[37,59],"asymmetric":[39],"case":[40],"of":[41,43],"compression":[42],"an":[44],"equipolarable":[45],"memoryless":[46],"source":[48],"with":[49],"side":[50],"information":[51],"at":[52],"decoder,":[54],"approach":[56],"based":[58],"modeling":[60],"correlation":[62],"as":[63],"a":[64],"using":[67,91],"syndromes.":[68],"The":[69,78],"encoding":[70],"decoding":[72],"procedures":[73],"are":[74],"explained":[75],"detail.":[77],"performance":[79],"achieved":[80],"seen":[82],"better":[85],"than":[86],"recently":[88],"published":[89],"results":[90],"nonconventional":[92],"turbo":[93],"limit.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}