{"id":"https://openalex.org/W2279289892","doi":"https://doi.org/10.1109/vtcfall.2015.7391048","title":"On the Performance of Tanner Graph Based and Viterbi Decoding for Erasure Recovery","display_name":"On the Performance of Tanner Graph Based and Viterbi Decoding for Erasure Recovery","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2279289892","doi":"https://doi.org/10.1109/vtcfall.2015.7391048","mag":"2279289892"},"language":"en","primary_location":{"id":"doi:10.1109/vtcfall.2015.7391048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2015.7391048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall)","raw_type":"proceedings-article"},"type":"preprint","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/A5030040379","display_name":"Muhammad Moazam Azeem","orcid":"https://orcid.org/0000-0002-1644-7240"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Muhammad Moazam Azeem","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ Paris, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ Paris, Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025518610","display_name":"Abdul Baqi Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143291","display_name":"\u200b\u200bJubail University College","ror":"https://ror.org/03cxjvr57","country_code":"SA","type":"education","lineage":["https://openalex.org/I4210143291"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Abdul Baqi Khan","raw_affiliation_strings":["Jubail University College, Kingdom of Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jubail University College, Kingdom of Saudi Arabia","institution_ids":["https://openalex.org/I4210143291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022931143","display_name":"Uzma Azeem","orcid":null},"institutions":[{"id":"https://openalex.org/I113133037","display_name":"Yanbu University College","ror":"https://ror.org/011adk382","country_code":"SA","type":"education","lineage":["https://openalex.org/I113133037"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Uzma Azeem","raw_affiliation_strings":["Yanbu Univ. Coll., Yanbu, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yanbu Univ. Coll., Yanbu, Saudi Arabia","institution_ids":["https://openalex.org/I113133037"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030040379"],"corresponding_institution_ids":["https://openalex.org/I39804081"],"apc_list":null,"apc_paid":null,"fwci":0.3506,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69186646,"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":"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.9983000159263611,"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.9983000159263611,"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.9957000017166138,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9939000010490417,"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/erasure","display_name":"Erasure","score":0.878761887550354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7998244762420654},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7565520405769348},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6481284499168396},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.6329510807991028},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5875502824783325},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.5451000928878784},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5234160423278809},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.43621087074279785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3747750520706177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3600935935974121},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.17872536182403564},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1114974319934845}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.878761887550354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7998244762420654},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7565520405769348},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6481284499168396},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6329510807991028},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5875502824783325},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.5451000928878784},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5234160423278809},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.43621087074279785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3747750520706177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3600935935974121},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.17872536182403564},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1114974319934845},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/vtcfall.2015.7391048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2015.7391048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01657923v1","is_oa":false,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-01657923","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"VTC Fall 2015 - IEEE 82nd Vehicular Technology Conference, Sep 2015, Boston, MA, United States. pp.1-5, ⟨10.1109/VTCFall.2015.7391048⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1985012157","https://openalex.org/W1985885539","https://openalex.org/W1998015853","https://openalex.org/W2140227657","https://openalex.org/W2162884985","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W4229922087","https://openalex.org/W6683918752"],"related_works":["https://openalex.org/W3008468562","https://openalex.org/W2030692836","https://openalex.org/W2045572789","https://openalex.org/W2045065505","https://openalex.org/W171822854","https://openalex.org/W2921374214","https://openalex.org/W2074577790","https://openalex.org/W1976246211","https://openalex.org/W2541970695","https://openalex.org/W2030175477"],"abstract_inverted_index":{"We":[0],"address":[1],"the":[2,11,41,57,72,79,84,121,128],"utilization":[3],"of":[4,28,64,86,98],"short":[5,30],"erasure":[6,44,58,96,113],"correcting":[7,45],"codes":[8,31,34,46],"to":[9,20,36,55,126],"recover":[10],"erased":[12],"data":[13,100],"in":[14,40,95],"opportunistic":[15],"spectrum":[16],"access":[17],"(OSA)":[18],"due":[19],"collisions":[21],"among":[22],"multiple":[23],"users.":[24],"The":[25,61,109],"main":[26],"application":[27],"using":[29],"over":[32],"long":[33,38],"is":[35,69,91,104,115],"avoid":[37],"delays":[39],"network.":[42],"Various":[43],"are":[47,53,124],"envisioned":[48],"and":[49,101,120],"their":[50],"decoding":[51,62,111,129],"methods":[52],"compared":[54,70,125],"analyze":[56,127],"recovery":[59,97,114],"capability.":[60],"performance":[63,103],"Tanner":[65],"graph":[66],"based":[67,75],"approach":[68,76],"with":[71,106,118],"Exhaustive":[73,107],"search":[74],"that":[77],"achieves":[78],"maximum":[80],"achievable":[81],"performance.":[82],"With":[83],"use":[85],"extended":[87],"H":[88],"matrix":[89],"there":[90],"a":[92],"huge":[93],"gain":[94],"lost":[99],"this":[102],"comparable":[105],"search.":[108],"Viterbi":[110],"for":[112],"also":[116],"described":[117],"examples":[119],"three":[122],"techniques":[123],"complexity.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}