{"id":"https://openalex.org/W2114933568","doi":"https://doi.org/10.1109/glocom.2005.1578091","title":"Low latency joint source-channel coding using overcomplete expansions and residual source redundancy","display_name":"Low latency joint source-channel coding using overcomplete expansions and residual source redundancy","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2114933568","doi":"https://doi.org/10.1109/glocom.2005.1578091","mag":"2114933568"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2005.1578091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1578091","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Kliewer","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electr. Eng., Notre Dame Univ., IN]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Notre Dame Univ., IN]","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063948113","display_name":"Alfred Mertins","orcid":"https://orcid.org/0000-0001-5718-577X"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Mertins","raw_affiliation_strings":["Signal Processing Group, University of Oldenburg, Oldenburg, Germany","University of Oldenburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal Processing Group, University of Oldenburg, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]},{"raw_affiliation_string":"University of Oldenburg","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.573,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68381565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"5 pp.","last_page":"2394"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10125","display_name":"Advanced Wireless Communication 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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/decoding-methods","display_name":"Decoding methods","score":0.70316481590271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.70221346616745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6588345766067505},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5889752507209778},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.540752649307251},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5373728275299072},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.5079298615455627},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.4685066044330597},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.45090100169181824},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4443933367729187},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4330781400203705},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4273241460323334},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.410855770111084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3382139503955841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2981312572956085},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18396899104118347},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.16624441742897034},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0934436023235321}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.70316481590271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.70221346616745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6588345766067505},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5889752507209778},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.540752649307251},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5373728275299072},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.5079298615455627},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.4685066044330597},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.45090100169181824},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4443933367729187},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4330781400203705},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4273241460323334},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.410855770111084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3382139503955841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2981312572956085},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18396899104118347},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.16624441742897034},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0934436023235321},{"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/glocom.2005.1578091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1578091","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.5059","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isip.uni-luebeck.de/uploads/tx_wapublications/globecom2005.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W1568341193","https://openalex.org/W1581934981","https://openalex.org/W1608864629","https://openalex.org/W1765199396","https://openalex.org/W1917420918","https://openalex.org/W1976318178","https://openalex.org/W2045407304","https://openalex.org/W2071283230","https://openalex.org/W2105605631","https://openalex.org/W2106756539","https://openalex.org/W2111866470","https://openalex.org/W2112653999","https://openalex.org/W2116953503","https://openalex.org/W2123327578","https://openalex.org/W2131697078","https://openalex.org/W2133553014","https://openalex.org/W2165170970","https://openalex.org/W2167393257"],"related_works":["https://openalex.org/W2020681921","https://openalex.org/W2147544396","https://openalex.org/W2105310134","https://openalex.org/W2001971590","https://openalex.org/W2327673555","https://openalex.org/W3102602607","https://openalex.org/W2167972000","https://openalex.org/W2134084011","https://openalex.org/W2113237800","https://openalex.org/W2038553764"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,72],"present":[4],"a":[5,53,61,121],"joint":[6],"source-channel":[7],"coding":[8],"method":[9],"which":[10],"employs":[11],"quantized":[12],"overcomplete":[13],"frame":[14,24],"expansions":[15,25],"that":[16,33,114],"are":[17,34,136],"binary":[18],"transmitted":[19],"through":[20],"noisy":[21],"channels.":[22],"The":[23,81,111],"can":[26],"be":[27],"interpreted":[28],"as":[29,103,105],"real-valued":[30],"block":[31,109],"codes":[32],"directly":[35],"applied":[36],"to":[37,41,58,99,106],"waveform":[38],"signals":[39],"prior":[40],"quantization.":[42],"At":[43],"the":[44,47,60,78,84,94,115,133],"decoder,":[45],"first":[46],"index-based":[48],"redundancy":[49],"is":[50,87,97,118],"used":[51],"by":[52],"soft-input":[54],"soft-output":[55],"source":[56],"decoder":[57],"determine":[59,74],"posteriori":[62],"probabilities":[63],"for":[64,77,89,120,132],"all":[65],"possible":[66],"symbols.":[67,80],"Given":[68],"these":[69],"symbol":[70],"probabilities,":[71],"then":[73],"least-squares":[75],"estimates":[76],"reconstructed":[79],"performance":[82],"of":[83,124],"proposed":[85],"approach":[86],"evaluated":[88],"code":[90],"constructions":[91],"based":[92],"on":[93],"DFT":[95],"and":[96],"compared":[98],"other":[100],"decoding":[101],"approaches":[102],"well":[104],"classical":[107],"BCH":[108],"codes.":[110],"results":[112],"show":[113],"new":[116],"technique":[117],"superior":[119],"wide":[122],"range":[123],"channel":[125],"conditions,":[126],"especially":[127],"when":[128],"strict":[129],"delay":[130],"constraints":[131],"transmission":[134],"system":[135],"given":[137]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}