{"id":"https://openalex.org/W2963142986","doi":"https://doi.org/10.23919/isita.2018.8664321","title":"Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain Codes","display_name":"Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain Codes","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2963142986","doi":"https://doi.org/10.23919/isita.2018.8664321","mag":"2963142986"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664321","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5041006442","display_name":"Yoshihiro Murayama","orcid":null},"institutions":[{"id":"https://openalex.org/I173915773","display_name":"Yamaguchi University","ror":"https://ror.org/03cxys317","country_code":"JP","type":"education","lineage":["https://openalex.org/I173915773"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yoshihiro Murayama","raw_affiliation_strings":["Dept. of Informatics, Yamaguchi University, JAPAN"],"affiliations":[{"raw_affiliation_string":"Dept. of Informatics, Yamaguchi University, JAPAN","institution_ids":["https://openalex.org/I173915773"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011452126","display_name":"T. Nozaki","orcid":"https://orcid.org/0000-0003-3102-5764"},"institutions":[{"id":"https://openalex.org/I173915773","display_name":"Yamaguchi University","ror":"https://ror.org/03cxys317","country_code":"JP","type":"education","lineage":["https://openalex.org/I173915773"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayuki Nozaki","raw_affiliation_strings":["Dept. of Informatics, Yamaguchi University, JAPAN"],"affiliations":[{"raw_affiliation_string":"Dept. of Informatics, Yamaguchi University, JAPAN","institution_ids":["https://openalex.org/I173915773"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041006442"],"corresponding_institution_ids":["https://openalex.org/I173915773"],"apc_list":null,"apc_paid":null,"fwci":0.7381,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76338958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"286","last_page":"290"},"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.995199978351593,"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.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.7976359128952026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7435155510902405},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7059333324432373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6377279758453369},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.6184431314468384},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.6070060729980469},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5636235475540161},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5148536562919617},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5054001808166504},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4950622618198395},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.410386323928833},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.40340757369995117},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19400814175605774}],"concepts":[{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.7976359128952026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7435155510902405},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7059333324432373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6377279758453369},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.6184431314468384},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.6070060729980469},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5636235475540161},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5148536562919617},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5054001808166504},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4950622618198395},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.410386323928833},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.40340757369995117},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19400814175605774},{"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.23919/isita.2018.8664321","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2029712200","https://openalex.org/W2161342511","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2417917902","https://openalex.org/W2584453001","https://openalex.org/W2963142986","https://openalex.org/W4229922087","https://openalex.org/W4244625299","https://openalex.org/W6732602398"],"related_works":["https://openalex.org/W2976106059","https://openalex.org/W2023731335","https://openalex.org/W2060232182","https://openalex.org/W2295671989","https://openalex.org/W2089476296","https://openalex.org/W2363930252","https://openalex.org/W1678468747","https://openalex.org/W2787656098","https://openalex.org/W4245031194","https://openalex.org/W2296600582"],"abstract_inverted_index":{"Fountain":[0],"codes":[1,5,70,73],"are":[2],"erasure":[3,81],"correcting":[4],"realizing":[6],"reliable":[7],"communication":[8],"systems":[9],"for":[10,102],"the":[11,14,27,36,52,57,62,86,103,110,115,120],"multicast":[12],"on":[13],"Internet.":[15],"The":[16,39],"zigzag":[17],"decodable":[18],"fountain":[19],"(ZDF)":[20],"code":[21,41],"is":[22,42],"one":[23],"of":[24,26,79],"generalization":[25],"Raptor":[28,72],"code,":[29],"i.e,":[30],"applying":[31],"shift":[32,67],"operation":[33],"to":[34],"generate":[35],"output":[37],"packets.":[38],"ZDF":[40,69,104],"decoded":[43],"by":[44],"a":[45,97],"two-stage":[46],"iterative":[47,75],"decoding":[48,76,80,92,100,116],"algorithm,":[49],"which":[50],"combines":[51],"packet-wise":[53],"peeling":[54,59,64,88],"algorithm":[55,65,89,101,112],"and":[56,66,83],"bit-wise":[58,63,87,99],"algorithm.":[60,122],"By":[61],"operation,":[68],"outperform":[71],"under":[74],"in":[77],"terms":[78],"rates":[82],"overheads.":[84],"However,":[85],"spends":[90],"long":[91],"time.":[93],"This":[94],"paper":[95],"proposes":[96],"fast":[98],"codes.":[105],"Simulation":[106],"results":[107],"show":[108],"that":[109],"proposed":[111],"drastically":[113],"reduces":[114],"time":[117],"compared":[118],"with":[119],"existing":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}