{"id":"https://openalex.org/W2119322397","doi":"https://doi.org/10.1109/itw.2008.4578677","title":"Practical codes for queueing channels: An algebraic, state-space, message-passing approach","display_name":"Practical codes for queueing channels: An algebraic, state-space, message-passing approach","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2119322397","doi":"https://doi.org/10.1109/itw.2008.4578677","mag":"2119322397"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2008.4578677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2008.4578677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Information Theory Workshop","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/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":"Todd P. Coleman","raw_affiliation_strings":["ECE Department Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","Department of ECE, University of Illinois at Urbana-Champaign, Urbana, IL#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of ECE, University of Illinois at Urbana-Champaign, Urbana, IL#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012789968","display_name":"Negar Kiyavash","orcid":"https://orcid.org/0000-0002-8545-7709"},"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":"Negar Kiyavash","raw_affiliation_strings":["CS Department Information Trust Institute, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","CS Department, Information Trust Institute, University of Illinois at Urbana-Champaign, 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Department Information Trust Institute, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"CS Department, Information Trust Institute, University of Illinois at Urbana-Champaign, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"322"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9988999962806702,"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.9986000061035156,"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/factor-graph","display_name":"Factor graph","score":0.7112270593643188},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6471408009529114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.599285900592804},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.5960758924484253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5952108502388},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5561330914497375},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.535570502281189},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5082147121429443},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4750261902809143},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4474336504936218},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4412306845188141},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.41555070877075195},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4127444326877594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3188905715942383},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08672317862510681},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08609336614608765}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.7112270593643188},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6471408009529114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599285900592804},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.5960758924484253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5952108502388},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5561330914497375},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.535570502281189},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5082147121429443},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4750261902809143},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4474336504936218},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4412306845188141},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.41555070877075195},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4127444326877594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3188905715942383},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08672317862510681},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08609336614608765},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2008.4578677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2008.4578677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Information Theory Workshop","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":20,"referenced_works":["https://openalex.org/W1989008275","https://openalex.org/W2050882265","https://openalex.org/W2107959360","https://openalex.org/W2115102992","https://openalex.org/W2121200972","https://openalex.org/W2125566184","https://openalex.org/W2125600492","https://openalex.org/W2130718424","https://openalex.org/W2134937280","https://openalex.org/W2139584447","https://openalex.org/W2142901448","https://openalex.org/W2150859678","https://openalex.org/W2151961505","https://openalex.org/W2152866991","https://openalex.org/W2156813077","https://openalex.org/W2159392076","https://openalex.org/W2169209400","https://openalex.org/W2171701465","https://openalex.org/W4301885439","https://openalex.org/W6806087461"],"related_works":["https://openalex.org/W2122977448","https://openalex.org/W2124250880","https://openalex.org/W4301665663","https://openalex.org/W2963109230","https://openalex.org/W4388627352","https://openalex.org/W4368755698","https://openalex.org/W3180766726","https://openalex.org/W3177262287","https://openalex.org/W2286197641","https://openalex.org/W2757022491"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"more":[3],"closely":[4],"the":[5,51,62,66,70,74,85],"probabilistic":[6],"dynamics":[7],"of":[8,55,65,69,84,93],"queueing":[9],"timing":[10],"channels":[11,98],"and":[12,24],"discusses":[13],"a":[14,40,56,80],"new":[15],"practical":[16],"coding":[17,94],"scheme":[18],"which":[19],"is":[20,114],"tailored":[21],"to":[22,43,47,77],"them":[23],"approaches":[25],"capacity.":[26],"We":[27,38,60,102],"consider":[28],"using":[29,50,110],"sparse":[30],"graph":[31,83],"coset":[32],"codes":[33],"over":[34],"nonbinary":[35],"finite":[36],"fields.":[37],"use":[39],"shaping":[41],"technique":[42],"map":[44],"algebraic":[45],"symbols":[46],"non-uniform":[48],"codewords":[49],"inverse":[52],"cumulative":[53],"distribution":[54,68],"target":[57],"random":[58],"variable.":[59],"exploit":[61],"graphical":[63,90],"structure":[64,91],"conditional":[67],"departure":[71],"process":[72,76],"given":[73],"arrival":[75],"arrive":[78],"at":[79],"Forney":[81],"factor":[82],"joint":[86],"likelihood":[87],"that":[88,106],"has":[89],"reminiscent":[92],"on":[95],"inter-symbol":[96],"interference":[97],"with":[99],"LDPC":[100],"codes.":[101],"show":[103],"through":[104],"simulation":[105],"this":[107],"technique,":[108],"when":[109],"low-complexity":[111],"iterative":[112],"decoding,":[113],"capacity-approaching.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"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":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
