{"id":"https://openalex.org/W18900052","doi":null,"title":"A multistage scheduled decoder for short block length low-density parity-check codes","display_name":"A multistage scheduled decoder for short block length low-density parity-check codes","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W18900052","mag":"18900052"},"language":"en","primary_location":{"id":"pmh:oai:https://spectrum.library.concordia.ca:975270","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/975270/1/MR28914.pdf","pdf_url":"https://spectrum.library.concordia.ca/975270/1/MR28914.pdf","source":{"id":"https://openalex.org/S4306400871","display_name":"Spectrum Research Repository (Concordia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I60158472","host_organization_name":"Concordia University","host_organization_lineage":["https://openalex.org/I60158472"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","indexed_in":[],"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/A5088858252","display_name":"Nazanin Elhami-Khorasani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nazanin Elhami-Khorasani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5088858252"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.0,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"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/low-density-parity-check-codes","display_name":"LDPC codes","score":0.9950000047683716},{"id":"https://openalex.org/keywords/iterative-decoding","display_name":"iterative decoding","score":0.9120000004768372},{"id":"https://openalex.org/keywords/deterministic-scheduling","display_name":"deterministic scheduling","score":0.5690000057220459},{"id":"https://openalex.org/keywords/sum-product-algorithm","display_name":"sum-product algorithm","score":0.7149999737739563},{"id":"https://openalex.org/keywords/soft-decision-decoding","display_name":"soft-decision decoding","score":0.7699999809265137},{"id":"https://openalex.org/keywords/hard-decision-decoding","display_name":"hard decision decoding","score":0.9580000042915344},{"id":"https://openalex.org/keywords/performance-complexity-tradeoff","display_name":"performance-complexity tradeoff","score":0.8669999837875366},{"id":"https://openalex.org/keywords/short-block-length-codes","display_name":"short block length codes","score":0.6909999847412109},{"id":"https://openalex.org/keywords/irregular-ldpc-codes","display_name":"irregular LDPC codes","score":0.8730000257492065}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8489575386047363},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6051511764526367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5923792123794556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5659915804862976},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5268591642379761},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4939013123512268},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.4629315733909607},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4543962776660919},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4214783310890198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.383247435092926},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.12420958280563354},{"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":"pmh:oai:https://spectrum.library.concordia.ca:975270","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/975270/1/MR28914.pdf","pdf_url":"https://spectrum.library.concordia.ca/975270/1/MR28914.pdf","source":{"id":"https://openalex.org/S4306400871","display_name":"Spectrum Research Repository (Concordia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I60158472","host_organization_name":"Concordia University","host_organization_lineage":["https://openalex.org/I60158472"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:18900052","doi":null,"is_oa":false,"landing_page_url":"https://spectrum.library.concordia.ca/id/eprint/975270/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2775836364","https://openalex.org/W1956376585","https://openalex.org/W1858795531","https://openalex.org/W2033303932","https://openalex.org/W1518608438","https://openalex.org/W1987014806","https://openalex.org/W606098413","https://openalex.org/W4411584206","https://openalex.org/W2125332127","https://openalex.org/W2533512122"],"abstract_inverted_index":{"Recent":[0],"advances":[1],"in":[2,48,241],"coding":[3],"theory":[4],"have":[5],"uncovered":[6],"the":[7,59,74,89,100,105,113,116,120,123,132,160,189,198,212,235,247],"previously":[8],"forgotten":[9],"power":[10],"of":[11,77,99,112,118,122,159,184,201,207,230,250],"Low-Density":[12,64],"Parity-Check":[13,65],"(LDPC)":[14],"codes.":[15,154],"Their":[16],"popularity":[17],"can":[18,223],"be":[19,224],"related":[20],"to":[21,30,35,87,135],"their":[22,28],"relatively":[23],"simple":[24],"iterative":[25,60],"decoders":[26],"and":[27,67,82,93,143,151,157,166,181,204],"potential":[29],"achieve":[31],"high":[32,199],"performance":[33,156,200,222],"close":[34],"shannon":[36],"limit.":[37],"These":[38],"make":[39],"them":[40],"an":[41,69],"attractive":[42],"candidate":[43],"for":[44,63,96,148,164,176],"error":[45],"correcting":[46],"application":[47],"communication":[49,190],"systems.":[50],"In":[51,193],"this":[52,194],"thesis,":[53],"we":[54,196],"focus":[55],"our":[56],"research":[57],"on":[58,110,131,188],"decoding":[61,71,149,185,213],"algorithms":[62,134,186,203,209],"codes":[66,79],"present":[68],"improved":[70,133],"algorithm.":[72],"First,":[73],"graph":[75,101,114],"structure":[76],"LDPC":[78,153,179],"is":[80,102,108,129,162,172,252],"studied":[81,163],"a":[83,137,173,216,220,245],"graph-based":[84],"search":[85],"algorithm":[86],"find":[88],"shortest":[90,94],"closed":[91],"walk":[92],"cycle":[95],"each":[97,242],"node":[98],"proposed.":[103],"Then,":[104],"Deterministic":[106,144],"schedule":[107,145],"applied":[109,130],"nodes":[111,236],"with":[115,226],"objective":[117],"preserving":[119],"optimality":[121],"algorithms.":[124,169],"Finally,":[125],"Hybrid":[126,141],"Switch-Type":[127],"technique":[128],"provide":[136],"desirable":[138,221],"complexity/performance":[139],"trade-off.":[140],"Technique":[142],"are":[146],"combined":[147],"regular":[150],"irregular":[152],"The":[155,170],"complexity":[158,206],"decoder":[161,175],"Sum-Product":[165],"Gallager":[167],"A":[168],"result":[171],"flexible":[174],"any":[177,182],"available":[178],"code":[180],"combination":[183],"based":[187],"systems":[191],"need.":[192],"technique,":[195],"benefit":[197],"soft-decision":[202],"low":[205],"hard-decision":[208],"by":[210],"changing":[211],"rule":[214],"after":[215],"few":[217],"iterations.":[218,232],"Hence,":[219],"obtained":[225],"less":[227],"average":[228],"number":[229,249],"soft":[231],"Moreover,":[233],"all":[234],"do":[237],"not":[238],"update":[239],"messages":[240],"iteration.":[243],"As":[244],"result,":[246],"total":[248],"computations":[251],"reduced":[253],"considerably":[254]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2016-06-24T00:00:00"}