{"id":"https://openalex.org/W2010024611","doi":"https://doi.org/10.1109/isit.2007.4557272","title":"On the Maximally Recoverable Property for Multi-Protection Group Codes","display_name":"On the Maximally Recoverable Property for Multi-Protection Group Codes","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2010024611","doi":"https://doi.org/10.1109/isit.2007.4557272","mag":"2010024611"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557272","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":"conference-paper","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/A5100602652","display_name":"Minghua Chen","orcid":"https://orcid.org/0000-0003-4763-0037"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minghua Chen","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","Microsoft Research (Redmond)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research (Redmond)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038498019","display_name":"Cheng Huang","orcid":"https://orcid.org/0000-0003-3769-7211"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cheng Huang","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","Microsoft Research (Redmond)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research (Redmond)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100364819","display_name":"Jin Li","orcid":"https://orcid.org/0000-0003-0385-8793"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jin Li","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","Microsoft Research (Redmond)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research (Redmond)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.2368,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.40651699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"486","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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.9970999956130981,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.996399998664856,"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/decoding-methods","display_name":"Decoding methods","score":0.7874709367752075},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.7582857012748718},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6854773759841919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6272798776626587},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.541364312171936},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5028511881828308},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4808233976364136},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.42911839485168457},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.39620667695999146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3759724795818329},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.320956826210022},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.04851078987121582}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7874709367752075},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.7582857012748718},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6854773759841919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6272798776626587},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.541364312171936},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5028511881828308},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4808233976364136},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.42911839485168457},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.39620667695999146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3759724795818329},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.320956826210022},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.04851078987121582},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557272","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":[{"id":"https://openalex.org/F4320322434","display_name":"Max-Planck-Gesellschaft","ror":"https://ror.org/01hhn8329"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W1972606153","https://openalex.org/W1996042140","https://openalex.org/W2092124262","https://openalex.org/W2099837838","https://openalex.org/W2121606987","https://openalex.org/W2123562143","https://openalex.org/W2128765501","https://openalex.org/W2139167772","https://openalex.org/W2147733496","https://openalex.org/W2610857016","https://openalex.org/W2987657883","https://openalex.org/W4239889878","https://openalex.org/W4300188436","https://openalex.org/W6613554288","https://openalex.org/W6632090173","https://openalex.org/W6643505971","https://openalex.org/W6673307582"],"related_works":["https://openalex.org/W2982181605","https://openalex.org/W2137028263","https://openalex.org/W2130518071","https://openalex.org/W3102119340","https://openalex.org/W2031335939","https://openalex.org/W1947543223","https://openalex.org/W4287065415","https://openalex.org/W1694938350","https://openalex.org/W2744779861","https://openalex.org/W1985967368"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,21,31,70,78,89],"maximally":[6],"recoverable":[7],"(MR)":[8],"property":[9,19,66],"for":[10,45],"multi-protection":[11],"group":[12],"(MPG)":[13],"codes.":[14],"MPG":[15,46,62],"codes":[16,47],"with":[17,48,64],"MR":[18,49,65],"achieve":[20],"best":[22],"erasure":[23],"recoverability":[24,55],"given":[25],"configurations,":[26],"where":[27,72],"a":[28],"configuration":[29],"represents":[30],"structural":[32],"relationship":[33],"between":[34],"data":[35,91],"and":[36,42,56],"parity":[37],"symbols.":[38,92],"We":[39,51],"present":[40],"construction":[41],"decoding":[43,58,73],"algorithms":[44],"property.":[50],"show":[52],"that":[53],"both":[54],"minimum":[57],"overhead":[59,74],"of":[60,81],"any":[61],"code":[63],"depend":[67],"only":[68],"on":[69],"configuration,":[71],"is":[75],"defined":[76],"as":[77],"additional":[79],"number":[80],"symbols":[82],"to":[83,87],"access,":[84],"in":[85],"order":[86],"decode":[88],"lost":[90]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}