{"id":"https://openalex.org/W2794738250","doi":"https://doi.org/10.1109/lcomm.2018.2820007","title":"A New Construction of EVENODD Codes With Lower Computational Complexity","display_name":"A New Construction of EVENODD Codes With Lower Computational Complexity","publication_year":2018,"publication_date":"2018-03-28","ids":{"openalex":"https://openalex.org/W2794738250","doi":"https://doi.org/10.1109/lcomm.2018.2820007","mag":"2794738250"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2018.2820007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2018.2820007","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","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/A5039863234","display_name":"Hanxu Hou","orcid":"https://orcid.org/0000-0001-7328-9341"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hanxu Hou","raw_affiliation_strings":["School of Electrical Engineering and Intelligentization, Dongguan University of Technology, Dongguan, China"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Intelligentization, Dongguan University of Technology, Dongguan, China","institution_ids":["https://openalex.org/I2799850029"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012129385","display_name":"Patrick P. C. Lee","orcid":"https://orcid.org/0000-0002-4501-4364"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Patrick P. C. Lee","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039863234"],"corresponding_institution_ids":["https://openalex.org/I2799850029"],"apc_list":null,"apc_paid":null,"fwci":2.2144,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.88744155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"22","issue":"6","first_page":"1120","last_page":"1123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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":1.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9947999715805054,"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.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6583954095840454},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6527612209320068},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5154184103012085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4392986297607422},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.3345333933830261},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3293995261192322}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6583954095840454},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6527612209320068},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5154184103012085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4392986297607422},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.3345333933830261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3293995261192322}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2018.2820007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2018.2820007","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3368205095","display_name":null,"funder_award_id":"61701115","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1490811843","https://openalex.org/W1502833055","https://openalex.org/W1622719107","https://openalex.org/W1746636920","https://openalex.org/W2104812861","https://openalex.org/W2105674592","https://openalex.org/W2137291643","https://openalex.org/W2147343704","https://openalex.org/W2208169092","https://openalex.org/W2212210399","https://openalex.org/W2411291190","https://openalex.org/W6629429446","https://openalex.org/W6636645890","https://openalex.org/W6637611892"],"related_works":["https://openalex.org/W2189341500","https://openalex.org/W4387560420","https://openalex.org/W2940671439","https://openalex.org/W4301871063","https://openalex.org/W1501319629","https://openalex.org/W2465912158","https://openalex.org/W1506049346","https://openalex.org/W2402047242","https://openalex.org/W1500761685","https://openalex.org/W2082036845"],"abstract_inverted_index":{"EVENODD":[0,25,57],"codes":[1,5],"are":[2,52],"binary":[3,34],"array":[4,38],"for":[6],"correcting":[7],"double":[8],"disk":[9],"failures":[10],"in":[11,58],"RAID-6":[12],"with":[13],"asymptotically":[14,63],"optimal":[15,64],"encoding":[16],"and":[17,47],"decoding":[18],"complexities.":[19],"However,":[20],"the":[21,44],"update":[22,48,65],"complexity":[23],"of":[24,33,50,56],"is":[26],"sub-optimal.":[27],"We":[28],"propose":[29],"a":[30],"new":[31],"construction":[32],"maximum":[35],"distance":[36],"separable":[37],"codes,":[39],"namely":[40],"EVENODD+,":[41],"such":[42],"that":[43],"encoding,":[45],"decoding,":[46],"complexities":[49],"EVENODD+":[51,61],"less":[53],"than":[54],"those":[55],"general.":[59],"Moreover,":[60],"achieves":[62],"complexity.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}