{"id":"https://openalex.org/W4221138369","doi":"https://doi.org/10.1109/isit50566.2022.9834854","title":"A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It","display_name":"A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4221138369","doi":"https://doi.org/10.1109/isit50566.2022.9834854"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834854","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5032083494","display_name":"Han Cai","orcid":"https://orcid.org/0000-0002-8476-1303"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Han Cai","raw_affiliation_strings":["Southwest Jiaotong University,School of Information Science and Technology,Chengdu,China,610031"],"affiliations":[{"raw_affiliation_string":"Southwest Jiaotong University,School of Information Science and Technology,Chengdu,China,610031","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Schwartz","raw_affiliation_strings":["Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032083494"],"corresponding_institution_ids":["https://openalex.org/I4800084"],"apc_list":null,"apc_paid":null,"fwci":0.2162,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.25291991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2625","last_page":"2630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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.9998999834060669,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9580000042915344,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9366999864578247,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7180656790733337},{"id":"https://openalex.org/keywords/field-size","display_name":"Field size","score":0.6034426689147949},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5940214991569519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4963262677192688},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4449712634086609},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.42643028497695923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3954271078109741},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3690428137779236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3419375717639923},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.18468421697616577},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08813655376434326},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07724729180335999}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7180656790733337},{"id":"https://openalex.org/C3019527723","wikidata":"https://www.wikidata.org/wiki/Q260899","display_name":"Field size","level":3,"score":0.6034426689147949},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5940214991569519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4963262677192688},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4449712634086609},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.42643028497695923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3954271078109741},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3690428137779236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3419375717639923},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.18468421697616577},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08813655376434326},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07724729180335999},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C104293457","wikidata":"https://www.wikidata.org/wiki/Q28324852","display_name":"Imaging phantom","level":2,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834854","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":42,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1957362188","https://openalex.org/W1980897883","https://openalex.org/W1993830711","https://openalex.org/W1996042140","https://openalex.org/W1997044393","https://openalex.org/W2014149071","https://openalex.org/W2050500290","https://openalex.org/W2060646539","https://openalex.org/W2076294573","https://openalex.org/W2124961791","https://openalex.org/W2155418912","https://openalex.org/W2333324284","https://openalex.org/W2335546159","https://openalex.org/W2885726234","https://openalex.org/W2901882031","https://openalex.org/W2908383142","https://openalex.org/W2956089011","https://openalex.org/W2963431689","https://openalex.org/W2963715592","https://openalex.org/W2963754206","https://openalex.org/W2963890921","https://openalex.org/W2963963730","https://openalex.org/W2964317282","https://openalex.org/W2964326991","https://openalex.org/W2964892028","https://openalex.org/W2973825613","https://openalex.org/W3010113848","https://openalex.org/W3081063762","https://openalex.org/W3095793903","https://openalex.org/W3100004208","https://openalex.org/W3103400821","https://openalex.org/W3104144315","https://openalex.org/W3104559424","https://openalex.org/W3111107997","https://openalex.org/W3124715992","https://openalex.org/W3136350169","https://openalex.org/W3206422952","https://openalex.org/W4221138369","https://openalex.org/W4287552873","https://openalex.org/W6756395562","https://openalex.org/W6786974865"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W2381570729","https://openalex.org/W1976205134","https://openalex.org/W4248336175","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W3009369890","https://openalex.org/W2964302506"],"abstract_inverted_index":{"We":[0],"prove":[1,42],"a":[2,26],"new":[3,70,75,85],"lower":[4],"bound":[5,76],"on":[6,77],"the":[7,33,50,78,84],"field":[8,79,91,105],"size":[9,92,106],"of":[10],"locally":[11],"repairable":[12],"codes":[13,21,31,54,68,88],"(LRCs).":[14],"Additionally,":[15],"we":[16,41,81],"construct":[17],"maximally":[18],"recoverable":[19],"(MR)":[20],"which":[22],"are":[23,99],"cyclic.":[24],"While":[25],"known":[27,51,97],"construction":[28,64],"for":[29],"MR":[30,53,67,87],"has":[32],"same":[34],"parameters,":[35],"it":[36],"produces":[37,65],"non-cyclic":[38,52],"codes.":[39],"Furthermore,":[40,72],"necessary":[43],"and":[44],"sufficient":[45],"conditions":[46],"that":[47,83],"specify":[48],"when":[49],"may":[55],"be":[56],"permuted":[57],"to":[58,102],"become":[59],"cyclic,":[60],"thus":[61],"proving":[62],"our":[63,74],"cyclic":[66,86],"with":[69],"parameters.":[71],"using":[73],"size,":[80],"show":[82],"have":[89,103],"optimal":[90,104],"in":[93,107],"certain":[94,108],"cases.":[95,109],"Other":[96],"LRCs":[98],"also":[100],"shown":[101]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}