{"id":"https://openalex.org/W4386075197","doi":"https://doi.org/10.1109/isit54713.2023.10206952","title":"Improved Field Size Bounds for Higher Order MDS Codes","display_name":"Improved Field Size Bounds for Higher Order MDS Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075197","doi":"https://doi.org/10.1109/isit54713.2023.10206952"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206952","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","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/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":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"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/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manik Dhar","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"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/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sivakanth Gopi","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1779,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89985083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1243","last_page":"1248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9955999851226807,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9905999898910522,"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/dimension","display_name":"Dimension (graph theory)","score":0.5896510481834412},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5392261147499084},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5225214958190918},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.46178844571113586},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4542671740055084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43630117177963257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4162902235984802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3936240077018738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35610371828079224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3229556083679199},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.12431135773658752},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06827419996261597}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5896510481834412},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5392261147499084},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5225214958190918},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46178844571113586},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4542671740055084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43630117177963257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4162902235984802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3936240077018738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35610371828079224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3229556083679199},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12431135773658752},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06827419996261597},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/isit54713.2023.10206952","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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":22,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1518341038","https://openalex.org/W1537045696","https://openalex.org/W2050687505","https://openalex.org/W2120575449","https://openalex.org/W2405991429","https://openalex.org/W2909303481","https://openalex.org/W2963439874","https://openalex.org/W2964144344","https://openalex.org/W2966402083","https://openalex.org/W3035375942","https://openalex.org/W3129053442","https://openalex.org/W3149161352","https://openalex.org/W4285191789","https://openalex.org/W4288391452","https://openalex.org/W4289655195","https://openalex.org/W4376651386","https://openalex.org/W6606324823","https://openalex.org/W6632200215","https://openalex.org/W6714117983","https://openalex.org/W6805351675","https://openalex.org/W6838896507"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2239445980","https://openalex.org/W2080152487","https://openalex.org/W3083152911","https://openalex.org/W4303635220"],"abstract_inverted_index":{"Higher":[0,58],"order":[1,47,59,70,152],"MDS":[2,9,48,60,80,153],"codes":[3,10,36,49,61,74,95,132,154],"are":[4,62,75,242],"an":[5,54,92,129,184,251,259],"interesting":[6],"generalization":[7],"of":[8,45,71,91,136,167,197,203,264],"recently":[11],"introduced":[12],"by":[13,64],"Brakensiek,":[14],"Gopi":[15],"and":[16,37,123,155,189,236,248],"Makam":[17],"(IEEE":[18],"Trans.":[19],"Inf.":[20],"Theory":[21],"2022).":[22],"In":[23,223,254],"later":[24],"works,":[25],"they":[26],"were":[27],"shown":[28],"to":[29,33,77,142,271],"be":[30],"intimately":[31],"connected":[32],"optimally":[34,156],"list-decodable":[35,157],"maximally":[38],"recoverable":[39],"tensor":[40],"codes.":[41,81],"Therefore":[42],"(explicit)":[43],"constructions":[44,196,219],"higher":[46,151],"over":[50,201,262],"small":[51],"fields":[52,202,263],"is":[53,96,105,108,140,220,234],"important":[55],"open":[56,185],"problem.":[57],"denoted":[63],"MDS(\u2113)":[65],"where":[66,212],"\u2113":[67],"denotes":[68],"the":[69,78,88,99,111,143,148,173,226,231,237],"generality,":[72],"MDS(2)":[73],"equivalent":[76],"usual":[79],"The":[82,208],"best":[83,100,238],"prior":[84],"lower":[85,124,228],"bound":[86,104,177,229],"on":[87,230],"field":[89,135,180,232],"size":[90,137,166,204,233,265],"(n,":[93,130,198,221],"k)-MDS(\u2113)":[94,199],"\u03a9\u2113(n\u2113\u22121),":[97],"whereas":[98],"known":[101,144,227,239],"(non-explicit)":[102],"upper":[103,122,145,240],"O\u2113(nk(\u2113\u22121))":[106],"which":[107,139,171,267],"exponential":[109,119,179],"in":[110],"dimension.In":[112],"this":[113,118,182,224,255],"work,":[114],"we":[115,159,213,257],"nearly":[116],"close":[117,141,270],"gap":[120],"between":[121,150],"bounds.":[125],"We":[126],"show":[127,160],"that":[128,161],"k)-MDS(3)":[131],"requires":[133,178],"a":[134,164,169,245],"\u03a9k(nk\u22121),":[138],"bound.":[146],"Using":[147],"connection":[149],"codes,":[158],"even":[162],"for":[163,244,250],"list":[165],"2,":[168],"code":[170,200],"meets":[172],"optimal":[174,218],"list-decoding":[175],"Singleton":[176],"size;":[181],"resolves":[183],"question":[186],"from":[187],"Shangguan":[188],"Tamo":[190],"(STOC":[191],"2020).We":[192],"also":[193],"give":[194,258],"explicit":[195,252,260],"${n^{{{(\\ell":[205],"k)}^{O(\\ell":[206],"k)}}}}$.":[207],"smallest":[209],"non-trivial":[210],"case":[211],"still":[214],"do":[215],"not":[216],"have":[217],"3)-MDS(3).":[222],"case,":[225],"\u03a9(n2)":[235],"bounds":[241],"O(n5)":[243],"non-explicit":[246],"construction":[247,261],"O(n32)":[249],"construction.":[253],"paper,":[256],"O(n3)":[266],"comes":[268],"very":[269],"being":[272],"optimal.":[273]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}