{"id":"https://openalex.org/W2971565883","doi":"https://doi.org/10.1109/tit.2019.2939464","title":"Constructions of Locally Recoverable Codes Which are Optimal","display_name":"Constructions of Locally Recoverable Codes Which are Optimal","publication_year":2019,"publication_date":"2019-09-04","ids":{"openalex":"https://openalex.org/W2971565883","doi":"https://doi.org/10.1109/tit.2019.2939464","mag":"2971565883"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2019.2939464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2939464","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1806.11492","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Giacomo Micheli","orcid":"https://orcid.org/0000-0002-5265-5207"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Giacomo Micheli","raw_affiliation_strings":["Mathematical Institute, University of Oxford, Oxford, U.K"],"raw_orcid":"https://orcid.org/0000-0002-5265-5207","affiliations":[{"raw_affiliation_string":"Mathematical Institute, University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":2.1178,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.90384662,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"66","issue":"1","first_page":"167","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9491999745368958,"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":0.9491999745368958,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.007699999958276749,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.006599999964237213,"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/finite-field","display_name":"Finite field","score":0.7490000128746033},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5460000038146973},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5163000226020813},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5013999938964844},{"id":"https://openalex.org/keywords/galois-theory","display_name":"Galois theory","score":0.4787999987602234},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.460999995470047},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.4438000023365021},{"id":"https://openalex.org/keywords/prime-power","display_name":"Prime power","score":0.36970001459121704}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.7490000128746033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6492000222206116},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5163000226020813},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C94398972","wikidata":"https://www.wikidata.org/wiki/Q92552","display_name":"Galois theory","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4731999933719635},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C174072685","wikidata":"https://www.wikidata.org/wiki/Q1667469","display_name":"Prime power","level":3,"score":0.36970001459121704},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3199000060558319},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27970001101493835},{"id":"https://openalex.org/C171686973","wikidata":"https://www.wikidata.org/wiki/Q17098676","display_name":"Macdonald polynomials","level":4,"score":0.27300000190734863},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2547000050544739},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2019.2939464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2939464","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1806.11492","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1806.11492","pdf_url":"https://arxiv.org/pdf/1806.11492","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:1806.11492","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1806.11492","pdf_url":"https://arxiv.org/pdf/1806.11492","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":[{"id":"https://openalex.org/G6015831203","display_name":"Regular Sets of Irreducible Polynomials, Applications of a Local to Global Principle for densities, and Cryptography","funder_award_id":"171248","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7200658341","display_name":"Regular Sets of Irreducible Polynomials, Applications of a Local to Global Principle for densities, and Cryptography","funder_award_id":"171249","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1557415002","https://openalex.org/W1778950143","https://openalex.org/W1997044393","https://openalex.org/W2008976700","https://openalex.org/W2021662392","https://openalex.org/W2022619326","https://openalex.org/W2050500290","https://openalex.org/W2060646539","https://openalex.org/W2067786239","https://openalex.org/W2103533615","https://openalex.org/W2154063365","https://openalex.org/W2339524574","https://openalex.org/W2623918255","https://openalex.org/W2941022152","https://openalex.org/W2963120590","https://openalex.org/W6679415789","https://openalex.org/W6760809794"],"related_works":[],"abstract_inverted_index":{"Let":[0],"q":[1],"be":[2,11],"a":[3,23],"prime":[4],"power":[5],"and":[6,36,53],"F":[7],"<sub":[8],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">q</sub>":[10],"the":[12,34,90,97,100],"finite":[13],"field":[14],"of":[15,39,63,75,89,99],"size":[16],"q.":[17],"In":[18],"this":[19],"paper":[20],"we":[21,48,80],"provide":[22],"Galois":[24],"theoretical":[25],"framework":[26],"that":[27,79],"allows":[28],"to":[29,84],"produce":[30],"good":[31,51,64],"polynomials":[32,52,65],"for":[33],"Tamo":[35],"Barg":[37],"construction":[38],"optimal":[40,55],"locally":[41],"recoverable":[42],"codes":[43],"(LRC).":[44],"Using":[45],"our":[46,69,76],"approach":[47],"construct":[49],"new":[50,58,70],"therefore":[54],"LRCs":[56],"with":[57],"parameters.":[59],"The":[60,72],"existing":[61],"theory":[62],"fits":[66],"entirely":[67],"in":[68],"framework.":[71],"key":[73],"advantage":[74],"method":[77],"is":[78,96],"do":[81],"not":[82],"need":[83],"rely":[85],"on":[86],"arithmetic":[87],"properties":[88],"pair":[91],"(q,":[92],"r),":[93],"where":[94],"r":[95],"locality":[98],"code.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2019-09-12T00:00:00"}