{"id":"https://openalex.org/W2133789648","doi":"https://doi.org/10.1109/isit.2007.4557409","title":"Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques","display_name":"Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2133789648","doi":"https://doi.org/10.1109/isit.2007.4557409","mag":"2133789648"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557409","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557409","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5031644344","display_name":"G. Schmidt","orcid":"https://orcid.org/0000-0001-6852-7560"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Georg Schmidt","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","Ulm Univ., Ulm"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072164594","display_name":"Vladimir Sidorenko","orcid":"https://orcid.org/0000-0003-4966-3684"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vladimir Sidorenko","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","Ulm Univ., Ulm"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045353828","display_name":"Martin Bossert","orcid":"https://orcid.org/0000-0002-3827-9065"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Bossert","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","Ulm Univ., Ulm"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031644344"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.11523633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1341","last_page":"1345"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9973000288009644,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9972000122070312,"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/decoding-methods","display_name":"Decoding methods","score":0.8695482015609741},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.8536068797111511},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8115313649177551},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7991867065429688},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6114909648895264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.604067325592041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5337128639221191},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5313228964805603},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4884463846683502},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.486227422952652},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4646213948726654},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3235931992530823},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30249470472335815}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8695482015609741},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.8536068797111511},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8115313649177551},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7991867065429688},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6114909648895264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.604067325592041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5337128639221191},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5313228964805603},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4884463846683502},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.486227422952652},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4646213948726654},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3235931992530823},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30249470472335815},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"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.1109/isit.2007.4557409","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557409","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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":14,"referenced_works":["https://openalex.org/W1968162029","https://openalex.org/W1996584657","https://openalex.org/W2029600846","https://openalex.org/W2032431003","https://openalex.org/W2089272132","https://openalex.org/W2114981480","https://openalex.org/W2122064826","https://openalex.org/W2133589924","https://openalex.org/W2165737598","https://openalex.org/W2394693224","https://openalex.org/W2951591976","https://openalex.org/W4231063788","https://openalex.org/W6674528855","https://openalex.org/W6679584241"],"related_works":["https://openalex.org/W1980817751","https://openalex.org/W1980909470","https://openalex.org/W1646172719","https://openalex.org/W2133789648","https://openalex.org/W2069567995","https://openalex.org/W2155511529","https://openalex.org/W1562578175","https://openalex.org/W2140424600","https://openalex.org/W2148621062","https://openalex.org/W1986638946"],"abstract_inverted_index":{"Reed-Solomon":[0,63,68],"codes":[1,89,106],"have":[2],"become":[3],"one":[4],"of":[5,10,96,102,112],"the":[6,35,45,76,94,100,109],"most":[7],"popular":[8],"classes":[9],"error":[11,41],"correcting":[12],"codes,":[13],"since":[14],"they":[15],"can":[16],"be":[17],"decoded":[18],"very":[19],"efficiently":[20],"up":[21],"to":[22,75,107],"half":[23,44],"their":[24],"minimum":[25,46],"distance":[26,47],"using":[27],"syndrome-based":[28,53],"techniques.":[29],"Modern":[30],"interpolation-based":[31],"decoding":[32,40,54,87,104,110],"algorithms":[33],"like":[34],"Sudan":[36,78],"algorithm":[37,55],"allow":[38],"for":[39,86],"patterns":[42],"beyond":[43],"in":[48],"polynomial":[49],"time.":[50],"Recently,":[51],"a":[52,62,83],"has":[56],"been":[57],"proposed,":[58],"which":[59,92],"virtually":[60],"extends":[61],"code":[64],"into":[65],"an":[66],"Interleaved":[67],"(IRS)":[69],"code.":[70],"This":[71],"method":[72,85],"is":[73,90],"competitive":[74],"classical":[77],"algorithm.":[79],"In":[80],"this":[81],"paper,":[82],"new":[84],"IRS":[88,105,114],"described,":[91],"combines":[93],"idea":[95,101],"syndrome":[97],"extension":[98],"and":[99],"collaboratively":[103],"increase":[108],"radius":[111],"low-rate":[113],"codes.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}