{"id":"https://openalex.org/W4401809234","doi":"https://doi.org/10.1109/tit.2024.3449030","title":"Improved Field Size Bounds for Higher Order MDS Codes","display_name":"Improved Field Size Bounds for Higher Order MDS Codes","publication_year":2024,"publication_date":"2024-08-23","ids":{"openalex":"https://openalex.org/W4401809234","doi":"https://doi.org/10.1109/tit.2024.3449030"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2024.3449030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3449030","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/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]},{"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":["Computer Science Department, Stanford University, Stanford, CA, USA","Department of Electrial Engineering and Computer Science, University of California, Berkeley"],"raw_orcid":"https://orcid.org/0000-0003-4149-7298","affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Electrial Engineering and Computer Science, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069822309","display_name":"Manik Dhar","orcid":"https://orcid.org/0009-0000-5570-7116"},"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"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manik Dhar","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA","Department of Mathematics, Massachusetts Institute of Technology, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Department of Mathematics, Massachusetts Institute of Technology, United States","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","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","Microsoft Research, United States"],"raw_orcid":"https://orcid.org/0000-0001-9706-4171","affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, United States","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6222,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62768175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"70","issue":"10","first_page":"6950","last_page":"6960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9861999750137329,"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.9835000038146973,"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/order","display_name":"Order (exchange)","score":0.5245683193206787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46637824177742004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43250128626823425},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4169856011867523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36759859323501587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3274660110473633},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3225364089012146}],"concepts":[{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5245683193206787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46637824177742004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43250128626823425},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4169856011867523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36759859323501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3274660110473633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3225364089012146},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2024.3449030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3449030","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":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W2050687505","https://openalex.org/W2120575449","https://openalex.org/W2405991429","https://openalex.org/W2909303481","https://openalex.org/W2964144344","https://openalex.org/W2966402083","https://openalex.org/W3035375942","https://openalex.org/W3129053442","https://openalex.org/W3149161352","https://openalex.org/W3184708196","https://openalex.org/W4240837394","https://openalex.org/W4285191789","https://openalex.org/W4288391452","https://openalex.org/W4376651386","https://openalex.org/W4377711312","https://openalex.org/W4386072296","https://openalex.org/W4389113903","https://openalex.org/W4390097886","https://openalex.org/W4399039536","https://openalex.org/W4399522330","https://openalex.org/W4399522383","https://openalex.org/W6606324823","https://openalex.org/W6632200215"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928"],"abstract_inverted_index":{"Higher":[0,53],"order":[1,42,54,63,145],"MDS":[2,9,43,55,72,146],"codes":[3,10,31,44,56,147],"are":[4,57,67],"an":[5,49,177,235,243],"interesting":[6],"generalization":[7],"of":[8,40,64,83,129,160,194,248],"recently":[11],"introduced":[12],"by":[13,180],"Brakensiek":[14],"et":[15],"al.,":[16],"(2023).":[17],"In":[18,107,212,238],"later":[19],"works,":[20],"they":[21],"were":[22],"shown":[23],"to":[24,28,69,135,253],"be":[25],"intimately":[26],"connected":[27],"optimally":[29,149],"list-decodable":[30,150],"and":[32,118,148,182],"maximally":[33],"recoverable":[34],"tensor":[35],"codes.":[36,73],"Therefore":[37],"(explicit)":[38],"constructions":[39,189,209],"higher":[41,144],"over":[45,192,246],"small":[46],"fields":[47,193,247],"is":[48,102,133],"important":[50],"open":[51,178],"problem.":[52],"denoted":[58],"by$\\rm":[59],"{MDS}(\\ell)$where$\\ell":[60],"$denotes":[61],"the":[62,70,80,92,105,136,141,166,215,220,225],"generality,$\\rm":[65],"{MDS}(2)$codes":[66],"equivalent":[68],"usual":[71],"The":[74,198],"best":[75,93,226],"prior":[76],"lower":[77,119,217],"bound":[78,97,170,218],"on":[79,219],"field":[81,128,173,221],"size":[82,159,222],"an${[}n,k{]}$-$\\rm":[84,124],"{MDS}(\\ell)$codes":[85],"is$\\Omega":[86,223],"_{\\ell":[87],"}":[88,99],"(n^{\\ell":[89],"-1})$,":[90],"whereas":[91],"known":[94,137,216,227],"(non-explicit)":[95],"upper":[96,117,138,228],"is$O_{\\ell":[98],"(n^{k(\\ell":[100],"-1)})$which":[101],"exponential":[103,114,172],"in":[104],"dimension.":[106],"this":[108,113,175,213,239],"work,":[109],"we":[110,152,203,241],"nearly":[111],"close":[112,134,252],"gap":[115],"between":[116,143],"bounds.":[120],"We":[121,185],"show":[122,153],"that":[123,154],"{MDS}(3)$codes":[125],"requires":[126,171],"a":[127,157,162,231],"size$\\Omega":[130],"_{k}(n^{k-1})$,":[131],"which":[132,164],"bound.":[139],"Using":[140],"connection":[142],"codes,":[151],"even":[155],"for":[156],"list":[158],"2,":[161],"code":[163],"meets":[165],"optimal":[167,208],"list-decoding":[168],"Singleton":[169],"size;":[174],"resolves":[176],"question":[179],"Shangguan":[181],"Tamo,":[183],"(2020).":[184],"also":[186],"give":[187,242],"explicit":[188,236,244],"of${[}n,k{]}$-$\\rm":[190],"{MDS}(\\ell)$code":[191],"size$n^{(\\ell":[195],"k)^{O(\\ell":[196],"k)}}$.":[197],"smallest":[199],"non-trivial":[200],"case":[201],"where":[202],"still":[204],"do":[205],"not":[206],"have":[207],"is${[}n,3{]}$-$\\rm":[210],"{MDS}(3)$.":[211],"case,":[214],"(n^{2})$and":[224],"bounds":[229],"are$O(n^{5})$for":[230],"non-explicit":[232],"construction":[233,245],"and$O(n^{32})$for":[234],"construction.":[237],"paper,":[240],"size$O(n^{3})$which":[249],"comes":[250],"very":[251],"being":[254],"optimal.":[255]},"counts_by_year":[{"year":2025,"cited_by_count":5}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}