{"id":"https://openalex.org/W2073480591","doi":"https://doi.org/10.1109/ncc.2014.6811240","title":"Optimal communication scheduling for iterative decoding of irregular codes","display_name":"Optimal communication scheduling for iterative decoding of irregular codes","publication_year":2014,"publication_date":"2014-02-01","ids":{"openalex":"https://openalex.org/W2073480591","doi":"https://doi.org/10.1109/ncc.2014.6811240","mag":"2073480591"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2014.6811240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2014.6811240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twentieth National Conference on Communications (NCC)","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/A5080593042","display_name":"Hrishikesh Sharma","orcid":"https://orcid.org/0000-0001-8550-7668"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Hrishikesh Sharma","raw_affiliation_strings":["TCS Innovation Labs, Tata Consultancy Services Ltd"],"affiliations":[{"raw_affiliation_string":"TCS Innovation Labs, Tata Consultancy Services Ltd","institution_ids":["https://openalex.org/I55215948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081499127","display_name":"Sivaramakrishnan Sivasubramanian","orcid":"https://orcid.org/0000-0003-0463-4409"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Sivasubramanian","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology, Bombay","Dept. of Mathematics, Indian Institute of Technology, Bombay,"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Mathematics, Indian Institute of Technology, Bombay,","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011009172","display_name":"Sachin Patkar","orcid":"https://orcid.org/0009-0003-6053-6886"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Patkar","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, Bombay","[Dept. of Electrical Engineering, Indian Institute of Technology Bombay]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, Indian Institute of Technology Bombay]","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080593042"],"corresponding_institution_ids":["https://openalex.org/I55215948"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15103874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2013","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.9998000264167786,"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.9998000264167786,"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.9890999794006348,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9866999983787537,"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/computer-science","display_name":"Computer science","score":0.7576075792312622},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6077479720115662},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.49360620975494385},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4774908721446991},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.47347843647003174},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46208828687667847},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.44726672768592834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4287177622318268},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40510624647140503},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2722799777984619},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25534674525260925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18367627263069153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16831010580062866},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.16437429189682007}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7576075792312622},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6077479720115662},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.49360620975494385},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4774908721446991},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.47347843647003174},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46208828687667847},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.44726672768592834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4287177622318268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40510624647140503},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2722799777984619},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25534674525260925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18367627263069153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16831010580062866},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.16437429189682007}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc.2014.6811240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2014.6811240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twentieth National Conference on Communications (NCC)","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":25,"referenced_works":["https://openalex.org/W1566669674","https://openalex.org/W1971663478","https://openalex.org/W2002807893","https://openalex.org/W2008217702","https://openalex.org/W2038487369","https://openalex.org/W2056752792","https://openalex.org/W2062921609","https://openalex.org/W2096084217","https://openalex.org/W2097988393","https://openalex.org/W2101198349","https://openalex.org/W2107787044","https://openalex.org/W2137699000","https://openalex.org/W2144962541","https://openalex.org/W2162752852","https://openalex.org/W2339307522","https://openalex.org/W2404135763","https://openalex.org/W2906211676","https://openalex.org/W2951711457","https://openalex.org/W4252026737","https://openalex.org/W4294567873","https://openalex.org/W6633763730","https://openalex.org/W6665021229","https://openalex.org/W6675294435","https://openalex.org/W6683945059","https://openalex.org/W6714050493"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2369600518","https://openalex.org/W2029144766","https://openalex.org/W2089275957","https://openalex.org/W2165241191","https://openalex.org/W2964031101"],"abstract_inverted_index":{"Many":[0],"important":[1],"and":[2,92],"newer":[3],"classes":[4],"of":[5,21,53,70,135,183,193],"error-correction":[6],"codes,":[7,81],"such":[8,26,35,89,114,130,136,184],"as":[9,42,90],"LDPC,":[10],"expander,":[11],"repeat-accumulate":[12],"or":[13,67,78],"polar":[14],"codes":[15,27,151],"have":[16,83,102],"a":[17,95],"bipartite":[18,36],"graph":[19],"representation":[20],"their":[22],"computation.":[23],"Decoders":[24],"for":[25,76,113,122,129,180],"are":[28,58,163],"practically":[29],"implemented":[30],"using":[31],"iterative":[32,39],"decoding":[33,40,71,107,127],"over":[34],"graphs.":[37],"The":[38,56,132],"progresses":[41],"per":[43],"various":[44],"communication":[45,87,111,123,133,186],"schedules":[46,57,75],"between":[47],"the":[48,54,65,68,126,148,155],"nodes":[49],"on":[50,158],"both":[51],"sides":[52],"graph.":[55],"designed":[59],"to":[60,104,190],"be":[61,169],"optimal":[62,74,110,185],"typically":[63],"in":[64,86,171,178],"latency":[66],"throughput":[69,134],"process.":[72],"Designing":[73],"irregular":[77,166],"partial":[79],"regular":[80],"which":[82,181],"found":[84],"way":[85],"standards":[88],"DVB-S2":[91],"WiMAX,":[93],"is":[94,139,145],"challenging":[96],"problem.":[97],"In":[98],"our":[99],"work,":[100],"we":[101,162],"tried":[103],"design":[105,192],"VLSI":[106],"schemes":[108],"having":[109],"schedule":[112],"codes.":[115,131],"We":[116],"employed":[117],"edge-coloring":[118],"based":[119,150],"greedy":[120],"approach":[121],"scheduling":[124,187],"during":[125],"process":[128],"decoder":[137],"systems":[138,177],"provably":[140],"optimal.":[141],"As":[142],"such,":[143],"it":[144],"well-known":[146],"that":[147,165],"irregular-graph":[149],"can":[152],"asymptotically":[153],"achieve":[154],"Shannon":[156],"limit":[157],"erasure":[159],"channels.":[160],"Hence":[161],"hopeful":[164],"graphs":[167],"will":[168,188],"used":[170],"many":[172],"other":[173],"practical":[174],"error":[175],"correction":[176],"future,":[179],"usage":[182],"lead":[189],"efficient":[191],"decoders.":[194]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}