{"id":"https://openalex.org/W2743248540","doi":"https://doi.org/10.1109/tcomm.2017.2737441","title":"An Encoding Algorithm of Triply Extended Reed\u2013Solomon Codes With Asymptotically Optimal Complexities","display_name":"An Encoding Algorithm of Triply Extended Reed\u2013Solomon Codes With Asymptotically Optimal Complexities","publication_year":2017,"publication_date":"2017-08-08","ids":{"openalex":"https://openalex.org/W2743248540","doi":"https://doi.org/10.1109/tcomm.2017.2737441","mag":"2743248540"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2017.2737441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2017.2737441","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","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/A5054764523","display_name":"Sian-Jheng Lin","orcid":"https://orcid.org/0000-0002-6309-2876"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Sian-Jheng Lin","raw_affiliation_strings":["CAS Key Laboratory of Electro-magnetic Space Information, School of Information Science and Technology, University of Science and Technology of China, Hefei, China"],"affiliations":[{"raw_affiliation_string":"CAS Key Laboratory of Electro-magnetic Space Information, School of Information Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054764523"],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":0.8288,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.76605247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"66","issue":"8","first_page":"3235","last_page":"3244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997000098228455,"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/T11130","display_name":"Coding theory and cryptography","score":0.9990000128746033,"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.9958000183105469,"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/computer-science","display_name":"Computer science","score":0.6007294654846191},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5821210741996765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5423347353935242},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5356452465057373},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5322261452674866},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4834190607070923},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.41123461723327637},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32250598073005676},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3089127540588379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3087344169616699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.143120676279068}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007294654846191},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5821210741996765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5423347353935242},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5356452465057373},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5322261452674866},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4834190607070923},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.41123461723327637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32250598073005676},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3089127540588379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3087344169616699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.143120676279068},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2017.2737441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2017.2737441","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2237748184","display_name":null,"funder_award_id":"WK2100000004","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W2757614","https://openalex.org/W154253821","https://openalex.org/W240418110","https://openalex.org/W1488265384","https://openalex.org/W1606480398","https://openalex.org/W1622719107","https://openalex.org/W1973056013","https://openalex.org/W1979925917","https://openalex.org/W2001350036","https://openalex.org/W2003191755","https://openalex.org/W2004879144","https://openalex.org/W2055835320","https://openalex.org/W2104812861","https://openalex.org/W2111554860","https://openalex.org/W2112143611","https://openalex.org/W2114197496","https://openalex.org/W2115552168","https://openalex.org/W2115599946","https://openalex.org/W2123723773","https://openalex.org/W2123820820","https://openalex.org/W2137291643","https://openalex.org/W2146868478","https://openalex.org/W2147323018","https://openalex.org/W2147343704","https://openalex.org/W2147504831","https://openalex.org/W2148575324","https://openalex.org/W2150777202","https://openalex.org/W2155828589","https://openalex.org/W2163775180","https://openalex.org/W2165339489","https://openalex.org/W2333324284","https://openalex.org/W2566254817","https://openalex.org/W3006030918","https://openalex.org/W3106482607","https://openalex.org/W4248578633","https://openalex.org/W6606324823","https://openalex.org/W6609210273","https://openalex.org/W6636645890","https://openalex.org/W6674481860"],"related_works":["https://openalex.org/W2534771569","https://openalex.org/W2037547261","https://openalex.org/W4311812695","https://openalex.org/W2117788426","https://openalex.org/W4242015792","https://openalex.org/W2291920536","https://openalex.org/W2164535554","https://openalex.org/W2133317661","https://openalex.org/W1993644742","https://openalex.org/W1580179249"],"abstract_inverted_index":{"In":[0],"this":[1,70],"paper,":[2],"we":[3],"devise":[4],"a":[5],"fast":[6],"encoding":[7],"algorithm":[8,76],"for":[9,46,77],"triply":[10],"extended":[11],"Reed-Solomon":[12],"codes.":[13,41],"The":[14,88,95],"proposed":[15,100],"approach":[16,83,101],"requires":[17],"approximately":[18],"two":[19,50,60],"XORs":[20,30,61],"per":[21,31,62],"bit,":[22],"which":[23],"improves":[24],"the":[25,54,65,72,78,84,99],"prior":[26],"result":[27],"of":[28,67],"three":[29,52],"bit":[32],"established":[33],"by":[34],"certain":[35],"maximum":[36],"distance":[37],"separable":[38],"(MDS)":[39],"array":[40],"We":[42],"also":[43],"prove":[44],"that,":[45],"MDS":[47,80],"codes":[48,81],"with":[49,90,106],"and":[51],"parities,":[53],"scheduling":[55,75],"algorithms":[56],"require":[57],"at":[58],"least":[59],"bit.":[63],"To":[64],"best":[66],"our":[68],"knowledge,":[69],"is":[71,93,102],"first":[73],"provable":[74],"triple-parity":[79],"to":[82],"theoretical":[85],"lower":[86],"bounds.":[87],"implementation":[89],"SIMD":[91],"instructions":[92],"provided.":[94],"simulations":[96],"show":[97],"that":[98],"competitive,":[103],"as":[104],"compared":[105],"other":[107],"cutting":[108],"edge":[109],"implementations.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}