{"id":"https://openalex.org/W4285191789","doi":"https://doi.org/10.1109/tit.2022.3187366","title":"Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes","display_name":"Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4285191789","doi":"https://doi.org/10.1109/tit.2022.3187366"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2022.3187366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2022.3187366","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":["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/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4149-7298","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038687630","display_name":"Sivakanth Gopi","orcid":"https://orcid.org/0000-0001-9706-4171"},"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":"Sivakanth Gopi","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9706-4171","affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050854456","display_name":"Visu Makam","orcid":"https://orcid.org/0000-0001-8470-7860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Visu Makam","raw_affiliation_strings":["Radix Trading Europe B.V., Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8470-7860","affiliations":[{"raw_affiliation_string":"Radix Trading Europe B.V., Amsterdam, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7047,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.838554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"68","issue":"11","first_page":"7125","last_page":"7140"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9954000115394592,"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/T10237","display_name":"Cryptography and Data Security","score":0.9847999811172485,"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/notation","display_name":"Notation","score":0.6746787428855896},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.5160602927207947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48068007826805115},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4446394145488739},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43318045139312744},{"id":"https://openalex.org/keywords/tensor-product","display_name":"Tensor product","score":0.42599090933799744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4046335816383362},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.335630863904953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3016466498374939},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2041088044643402},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15555527806282043},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10124680399894714}],"concepts":[{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.6746787428855896},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.5160602927207947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48068007826805115},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4446394145488739},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43318045139312744},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.42599090933799744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4046335816383362},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.335630863904953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3016466498374939},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2041088044643402},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15555527806282043},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10124680399894714},{"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/tit.2022.3187366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2022.3187366","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G540782784","display_name":null,"funder_award_id":"CCF\u20101412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5963912892","display_name":null,"funder_award_id":"CCF\u20101900460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G698653145","display_name":null,"funder_award_id":"DMS - 1638352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320320974","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1599026900","https://openalex.org/W1767936930","https://openalex.org/W1968245619","https://openalex.org/W1993830711","https://openalex.org/W2010024611","https://openalex.org/W2060646539","https://openalex.org/W2080132708","https://openalex.org/W2090605216","https://openalex.org/W2138744797","https://openalex.org/W2333324284","https://openalex.org/W2339524574","https://openalex.org/W2405991429","https://openalex.org/W2555108336","https://openalex.org/W2744311935","https://openalex.org/W2909303481","https://openalex.org/W2956089011","https://openalex.org/W2964310128","https://openalex.org/W2964326991","https://openalex.org/W2964892028","https://openalex.org/W2965330813","https://openalex.org/W3111701241","https://openalex.org/W3129053442","https://openalex.org/W3136350169","https://openalex.org/W3183881215","https://openalex.org/W3196529791","https://openalex.org/W3206422952","https://openalex.org/W4288391452","https://openalex.org/W4291999168","https://openalex.org/W4376651386","https://openalex.org/W6606324823","https://openalex.org/W6628361010","https://openalex.org/W6638144794","https://openalex.org/W6838896507"],"related_works":["https://openalex.org/W4281971614","https://openalex.org/W2504004674","https://openalex.org/W2390933768","https://openalex.org/W2963177394","https://openalex.org/W1595229445","https://openalex.org/W2498744856","https://openalex.org/W4390482104","https://openalex.org/W322408318","https://openalex.org/W4386687603","https://openalex.org/W4307007469"],"abstract_inverted_index":{"An$(m,n,a,b)$-tensor":[0],"code":[1,20,28,159,165,224],"consists":[2],"of$m\\times":[3],"n$matrices":[4],"whose":[5],"columns":[6,113],"satisfy":[7,13,114,174],"\u2018$a$\u2019":[8],"parity":[9,15,117],"checks":[10,16],"and":[11,29,94,181],"rows":[12],"\u2018$b$\u2019":[14],"(i.e.,":[17],"a":[18,26,40,115,150,157,206,214],"tensor":[19,23,65,158,186,223],"is":[21,74,132,166,218],"the":[22,106,112,122,137,143,163,200,221],"product":[24],"of":[25,124,136,145,147,190],"column":[27],"row":[30,51,164],"code).":[31],"Tensor":[32,57,85],"codes":[33,66,128,187],"are":[34,64,87,92],"useful":[35],"in":[36,149],"distributed":[37],"storage":[38],"because":[39],"single":[41,116],"erasure":[42,71,90,216],"can":[43,68],"be":[44],"corrected":[45],"quickly":[46],"either":[47],"by":[48,60,220],"reading":[49],"its":[50],"or":[52],"column.":[53],"Maximally":[54],"Recoverable":[55],"(MR)":[56],"Codes,":[58],"introduced":[59],"Gopalan":[61],"et":[62],"al.,":[63],"which":[67,89,131],"correct":[69],"every":[70],"pattern":[72,217],"that":[73,156],"information":[75],"theoretically":[76],"possible":[77],"to":[78,199,211],"correct.":[79],"The":[80],"main":[81],"questions":[82],"about":[83],"MR":[84,161,222],"Codes":[86],"characterizing":[88],"patterns":[91],"correctable":[93,219],"obtaining":[95],"explicit":[96],"constructions":[97],"over":[98],"small":[99],"fields.":[100],"In":[101],"this":[102,179],"paper,":[103],"we":[104,183],"study":[105],"important":[107],"special":[108],"case":[109],"when$a=1$,":[110],"i.e.,":[111],"check":[118,212],"equation.":[119],"We":[120,153,169,203],"introduce":[121],"notion":[123],"higher":[125],"order":[126,144],"MDS":[127,139],"($\\mathrm":[129],"{MDS}(\\ell)$codes)":[130],"an":[133],"interesting":[134],"generalization":[135],"well-known":[138],"codes,":[140],"where$\\ell":[141],"$captures":[142],"genericity":[146],"points":[148],"low-dimensional":[151],"space.":[152],"then":[154,170],"prove":[155,184],"with$a=1$is":[160],"if":[162,213],"an$\\mathrm":[167],"{MDS}(m)$code.":[168],"show":[171],"that$\\mathrm":[172],"{MDS}(m)$codes":[173],"some":[175],"weak":[176],"duality.":[177],"Using":[178],"characterization":[180],"duality,":[182],"that$(m,n,a=1,b)$-MR":[185],"require":[188],"fields":[189],"size$q=\\Omega":[191],"_{m,b}(n^{\\min":[192],"\\{b,m\\}-1})$.":[193],"Our":[194],"lower":[195],"bound":[196],"also":[197,204],"extends":[198],"setting":[201],"of$a>1$.":[202],"give":[205],"deterministic":[207],"polynomial":[208],"time":[209],"algorithm":[210],"given":[215],"(when$a=1$).":[225]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}