{"id":"https://openalex.org/W2176772360","doi":"https://doi.org/10.1109/tit.2013.2287477","title":"Burst List Decoding of Interleaved Reed\u2013Solomon Codes","display_name":"Burst List Decoding of Interleaved Reed\u2013Solomon Codes","publication_year":2013,"publication_date":"2013-11-19","ids":{"openalex":"https://openalex.org/W2176772360","doi":"https://doi.org/10.1109/tit.2013.2287477","mag":"2176772360"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2287477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2287477","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5004166192","display_name":"Tom Kolan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210167297","display_name":"IBM Research - Haifa","ror":"https://ror.org/05rw9t746","country_code":"IL","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210167297"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Tom Kolan","raw_affiliation_strings":["IBM Research Division, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, Haifa, Israel","institution_ids":["https://openalex.org/I4210167297"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron M. Roth","raw_affiliation_strings":["Computer Science Department, Technion, Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004166192"],"corresponding_institution_ids":["https://openalex.org/I4210167297"],"apc_list":null,"apc_paid":null,"fwci":0.4809,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.775205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"60","issue":"1","first_page":"182","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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/T12162","display_name":"Cellular Automata and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9934999942779541,"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/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.8276408910751343},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8204939961433411},{"id":"https://openalex.org/keywords/burst-error","display_name":"Burst error","score":0.7432677745819092},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7125989198684692},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5788174271583557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5757205486297607},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.5681191086769104},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5190913677215576},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.515393853187561},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.48122692108154297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4457119107246399},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4440533518791199},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4374125301837921},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4140101373195648},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3907157778739929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32560640573501587},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.0583987832069397},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.055922865867614746}],"concepts":[{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.8276408910751343},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8204939961433411},{"id":"https://openalex.org/C113283315","wikidata":"https://www.wikidata.org/wiki/Q1017059","display_name":"Burst error","level":3,"score":0.7432677745819092},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7125989198684692},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5788174271583557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5757205486297607},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.5681191086769104},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5190913677215576},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.515393853187561},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.48122692108154297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4457119107246399},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4440533518791199},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4374125301837921},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4140101373195648},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3907157778739929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32560640573501587},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0583987832069397},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.055922865867614746},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2013.2287477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2287477","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.46000000834465027,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W2032431003","https://openalex.org/W2089272132","https://openalex.org/W2100852839","https://openalex.org/W2113839738","https://openalex.org/W2133589924","https://openalex.org/W2146078064","https://openalex.org/W2162725776","https://openalex.org/W2182112064","https://openalex.org/W2895239415","https://openalex.org/W6679616441"],"related_works":["https://openalex.org/W1980817751","https://openalex.org/W2359973017","https://openalex.org/W1548705449","https://openalex.org/W2050784748","https://openalex.org/W2247418595","https://openalex.org/W4245516769","https://openalex.org/W1975709480","https://openalex.org/W4253103868","https://openalex.org/W2121498709","https://openalex.org/W2255105136"],"abstract_inverted_index":{"It":[0],"is":[1,26,29,48],"shown":[2,49],"that":[3,28,52],"interleaved":[4],"Reed\u2013Solomon":[5,41,58],"codes":[6],"can":[7],"be":[8],"list-decoded":[9],"for":[10,19,38],"burst":[11,35],"errors":[12],"while":[13],"attaining":[14],"the":[15,54,65,70],"generalized":[16],"Reiger":[17],"bound":[18],"list":[20,36,66],"decoding.":[21],"A":[22],"respective":[23],"decoding":[24,67],"algorithm":[25],"presented":[27],"(significantly)":[30],"more":[31],"efficient":[32],"than":[33],"a":[34,39],"decoder":[37],"noninterleaved":[40],"code":[42],"with":[43],"comparable":[44],"parameters.":[45],"Finally,":[46],"it":[47],"through":[50],"counterexamples":[51],"unlike":[53],"special":[55],"case":[56],"of":[57,69],"codes,":[59],"interleaving":[60],"does":[61],"not":[62],"always":[63],"preserve":[64],"properties":[68],"constituent":[71],"code.":[72]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}