{"id":"https://openalex.org/W2091697266","doi":"https://doi.org/10.1109/isit.2010.5513705","title":"A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm","display_name":"A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2091697266","doi":"https://doi.org/10.1109/isit.2010.5513705","mag":"2091697266"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1006.0170","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sabine Kampf","orcid":null},"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"]},{"id":"https://openalex.org/I90697900","display_name":"EBS University of Business and Law","ror":"https://ror.org/01js9jv94","country_code":"DE","type":"education","lineage":["https://openalex.org/I90697900"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sabine Kampf","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany","institution_ids":["https://openalex.org/I90697900","https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":null,"display_name":"Martin Bossert","orcid":null},"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"]},{"id":"https://openalex.org/I90697900","display_name":"EBS University of Business and Law","ror":"https://ror.org/01js9jv94","country_code":"DE","type":"education","lineage":["https://openalex.org/I90697900"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Bossert","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany","institution_ids":["https://openalex.org/I90697900","https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391","https://openalex.org/I90697900"],"apc_list":null,"apc_paid":null,"fwci":0.9391,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.8150532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1090","last_page":"1094"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9980000257492065,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.6567000150680542},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6065000295639038},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.572700023651123},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49720001220703125},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4957999885082245},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4235999882221222},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4092000126838684},{"id":"https://openalex.org/keywords/difference-map-algorithm","display_name":"Difference-map algorithm","score":0.40529999136924744}],"concepts":[{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.6567000150680542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6191999912261963},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6065000295639038},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.572700023651123},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49720001220703125},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4957999885082245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4927999973297119},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41530001163482666},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4092000126838684},{"id":"https://openalex.org/C3561768","wikidata":"https://www.wikidata.org/wiki/Q5275267","display_name":"Difference-map algorithm","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.3605000078678131},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.35429999232292175},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.3294000029563904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3124000132083893},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.3100000023841858},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2971999943256378},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.2727999985218048},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.2687000036239624},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.2612000107765198}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1006.0170","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1006.0170","pdf_url":"https://arxiv.org/pdf/1006.0170","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1006.0170","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1006.0170","pdf_url":"https://arxiv.org/pdf/1006.0170","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2016833807","https://openalex.org/W2138779125","https://openalex.org/W2155020285","https://openalex.org/W2158558186","https://openalex.org/W6635072419"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,7,27],"method":[4],"to":[5],"determine":[6],"set":[8],"of":[9,23,29],"basis":[10],"polynomials":[11],"from":[12],"the":[13],"extended":[14],"Euclidean":[15],"algorithm":[16],"that":[17],"allows":[18],"Generalized":[19],"Minimum":[20],"Distance":[21],"decoding":[22],"Reed-Solomon":[24],"codes":[25],"with":[26],"complexity":[28],"O(nd).":[30]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}