{"id":"https://openalex.org/W2166747824","doi":"https://doi.org/10.1109/icc.2009.5199227","title":"Novel Shaping and Complexity-Reduction Techniques for Approaching Capacity over Queuing Timing Channels","display_name":"Novel Shaping and Complexity-Reduction Techniques for Approaching Capacity over Queuing Timing Channels","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2166747824","doi":"https://doi.org/10.1109/icc.2009.5199227","mag":"2166747824"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5199227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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/A5012789968","display_name":"Negar Kiyavash","orcid":"https://orcid.org/0000-0002-8545-7709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Kiyavash","raw_affiliation_strings":["CS Department Information Trust Institute, University of Illinois, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Department Information Trust Institute, University of Illinois, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046582466","display_name":"Todd P. Coleman","orcid":"https://orcid.org/0000-0002-2144-2495"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. P. Coleman","raw_affiliation_strings":["ECE Department, University of Illinois, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, University of Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044634366","display_name":"Miguel R. D. Rodrigues","orcid":"https://orcid.org/0000-0002-8908-847X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. R. D. Rodrigues","raw_affiliation_strings":["ECE Department, University of Illinois, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, University of Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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/T10796","display_name":"Cooperative Communication and Network Coding","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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7594547271728516},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.7029589414596558},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6013907790184021},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.568827748298645},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.521573007106781},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4410705864429474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4384040832519531},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43150627613067627},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4185720384120941},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4050283432006836},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24552977085113525},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.19057762622833252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1374988555908203}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7594547271728516},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7029589414596558},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6013907790184021},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.568827748298645},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.521573007106781},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4410705864429474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4384040832519531},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43150627613067627},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4185720384120941},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4050283432006836},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24552977085113525},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.19057762622833252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1374988555908203},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5199227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1512015702","https://openalex.org/W1512888666","https://openalex.org/W2050882265","https://openalex.org/W2107465879","https://openalex.org/W2110407935","https://openalex.org/W2111992817","https://openalex.org/W2119322397","https://openalex.org/W2121200972","https://openalex.org/W2125566184","https://openalex.org/W2125600492","https://openalex.org/W2130718424","https://openalex.org/W2134887275","https://openalex.org/W2139584447","https://openalex.org/W2142901448","https://openalex.org/W2152866991","https://openalex.org/W2156813077","https://openalex.org/W2171701465","https://openalex.org/W4205855417","https://openalex.org/W4301885439"],"related_works":["https://openalex.org/W2978729728","https://openalex.org/W3203142394","https://openalex.org/W4302615923","https://openalex.org/W4288966080","https://openalex.org/W2351061015","https://openalex.org/W2017509870","https://openalex.org/W4360952157","https://openalex.org/W4220731478","https://openalex.org/W4315777848","https://openalex.org/W4282958949"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"practical":[3,45],"codes":[4,34,48],"for":[5,23,71],"communication":[6],"via":[7],"packet":[8],"timings":[9],"across":[10],"network":[11],"queuing":[12,114,144],"systems":[13,145],"-":[14],"an":[15,96],"instantiation":[16],"of":[17,80,139],"the":[18,55,65,78,81,87,124,137,152],"\"Bits":[19],"Through":[20],"Queues\"":[21],"result":[22],"timing":[24,46],"channels.":[25],"It":[26],"has":[27],"recently":[28],"been":[29],"shown":[30],"that":[31],"sparse-graph":[32],"linear":[33,131],"followed":[35],"by":[36],"shaping":[37,66,98],"techniques,":[38],"combined":[39],"with":[40,49,103,117,146],"message-passing":[41,82,125],"decoding,":[42],"can":[43],"enable":[44],"channel":[47],"low":[50,147],"symbol":[51,148],"error":[52,149],"rates":[53,150],"near":[54,151],"capacity.":[56,153],"The":[57],"previous":[58],"work":[59],"had":[60],"two":[61],"main":[62],"drawbacks.":[63],"First,":[64],"technique":[67,99],"was":[68,84],"only":[69],"effective":[70],"very":[72],"large":[73,119],"finite":[74],"field":[75],"sizes.":[76],"Secondly,":[77],"complexity":[79,127],"decoder":[83],"quadratic":[85,129],"in":[86,132],"block":[88,133],"length.":[89,134],"In":[90],"this":[91,140],"work,":[92],"1)":[93],"we":[94,109],"develop":[95],"alternative":[97],"using":[100],"random":[101],"dithers":[102],"provably":[104],"good":[105],"statistical":[106],"guarantees;":[107],"2)":[108],"exploit":[110],"Little's":[111],"Law":[112],"from":[113,128],"theory":[115],"along":[116],"a":[118],"deviations":[120],"argument":[121],"to":[122,130],"reduce":[123],"decoder's":[126],"We":[135],"illustrate":[136],"effectiveness":[138],"approach":[141],"on":[142],"simulated":[143]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}