{"id":"https://openalex.org/W4384787895","doi":"https://doi.org/10.1109/jsait.2023.3295836","title":"New Bounds on the Size of Binary Codes With Large Minimum Distance","display_name":"New Bounds on the Size of Binary Codes With Large Minimum Distance","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4384787895","doi":"https://doi.org/10.1109/jsait.2023.3295836"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2023.3295836","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/jsait.2023.3295836","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in 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/A5064472444","display_name":"James Chin-Jen Pang","orcid":"https://orcid.org/0000-0002-0735-8967"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James Chin-Jen Pang","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012221966","display_name":"S. Sandeep Pradhan","orcid":"https://orcid.org/0000-0001-8406-4404"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sandeep Pradhan","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064472444"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.6993,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75076379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"219","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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.9940000176429749,"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/combinatorics","display_name":"Combinatorics","score":0.7446099519729614},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6902486085891724},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6679324507713318},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.6659556031227112},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6261288523674011},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5698082447052002},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5093635320663452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47508159279823303},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.449504017829895},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4475036859512329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10917970538139343},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08569124341011047}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7446099519729614},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6902486085891724},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6679324507713318},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.6659556031227112},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6261288523674011},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5698082447052002},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5093635320663452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47508159279823303},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.449504017829895},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4475036859512329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10917970538139343},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08569124341011047},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsait.2023.3295836","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/jsait.2023.3295836","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4155322781","display_name":null,"funder_award_id":"CCF\u20131909771","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7715040519","display_name":null,"funder_award_id":"CCF\u20132132815","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1498820893","https://openalex.org/W1601517519","https://openalex.org/W1606480398","https://openalex.org/W1831230998","https://openalex.org/W1976543297","https://openalex.org/W1981078592","https://openalex.org/W1988985276","https://openalex.org/W1991401790","https://openalex.org/W1998417411","https://openalex.org/W2010992853","https://openalex.org/W2013931818","https://openalex.org/W2014944833","https://openalex.org/W2053716525","https://openalex.org/W2056125990","https://openalex.org/W2063994293","https://openalex.org/W2073236804","https://openalex.org/W2083774980","https://openalex.org/W2087737172","https://openalex.org/W2103749128","https://openalex.org/W2109084006","https://openalex.org/W2129496126","https://openalex.org/W2165855190","https://openalex.org/W2170716519","https://openalex.org/W2566392544","https://openalex.org/W2575056734","https://openalex.org/W2953009186","https://openalex.org/W2962910202","https://openalex.org/W3005799687","https://openalex.org/W3013182834","https://openalex.org/W3014144931","https://openalex.org/W3133660910","https://openalex.org/W3138355547","https://openalex.org/W3174972577","https://openalex.org/W3175858942","https://openalex.org/W3180641418","https://openalex.org/W3196317722","https://openalex.org/W3196445387","https://openalex.org/W4225672244","https://openalex.org/W4229826396","https://openalex.org/W4294691147","https://openalex.org/W4309956157","https://openalex.org/W4313550028","https://openalex.org/W4316660703","https://openalex.org/W4387362425","https://openalex.org/W6604469142","https://openalex.org/W6675597036","https://openalex.org/W6792262127","https://openalex.org/W6794894956","https://openalex.org/W6810485222","https://openalex.org/W6847233782"],"related_works":["https://openalex.org/W2545576618","https://openalex.org/W2778025365","https://openalex.org/W2019417807","https://openalex.org/W1986045152","https://openalex.org/W4289655279","https://openalex.org/W2046877102","https://openalex.org/W2114972298","https://openalex.org/W2162118201","https://openalex.org/W2092243741","https://openalex.org/W3103742664"],"abstract_inverted_index":{"Let":[0],"<inline-formula":[1,18,28,35,53,62,89,104,141,150,163,171,181,188,261,270,294,310,325,357],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,19,29,36,54,63,90,105,142,151,164,172,182,189,262,271,295,311,326,358],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[3,20,30,37,55,64,91,106,143,152,165,173,183,190,263,272,296,312,327,359],"<tex-math":[4,21,31,38,56,65,92,107,144,153,166,174,184,191,264,273,297,313,328,360],"notation=\"LaTeX\">$A(n,":[5,39,57,93,298],"d)$":[6,40,58,94],"</tex-math></inline-formula>":[7,23,59,95,177,186,308,318,362],"denote":[8],"the":[9,71,97,131,136,209,215,222,249,258,332,337,347,375,380],"maximum":[10],"size":[11,162],"of":[12,16,70,122,208,239,257,287,334],"a":[13,119,228,237,254,284],"binary":[14,132],"code":[15,201,232],"length":[17,140],"notation=\"LaTeX\">$n$":[22,66,329,361],"and":[24,85,161,178,230,247,343],"minimum":[25,259],"Hamming":[26],"distance":[27,99,149,224,260,383],"notation=\"LaTeX\">$d$":[32,265],"</tex-math></inline-formula>.":[33,115,199,280,330],"Studying":[34],"</tex-math></inline-formula>,":[41,148,160,168,266],"including":[42],"efforts":[43],"to":[44,49,341],"determine":[45],"it":[46],"as":[47],"well":[48],"derive":[50],"bounds":[51,87,292],"on":[52,88,293],"for":[60,135,169],"large":[61],"</tex-math></inline-formula>\u2019s,":[67],"is":[68,346],"one":[69],"most":[72],"fundamental":[73],"subjects":[74],"in":[75,96,101,130,221,253,267,324,356,363,379],"coding":[76],"theory.":[77],"In":[78],"this":[79,364],"paper,":[80],"we":[81,235],"explore":[82],"new":[83,120],"lower":[84,219,251],"upper":[86,291,338,351,371,377],"large-minimum":[98,223],"regime,":[100],"particular,":[102,268],"when":[103,269],"notation=\"LaTeX\">$d":[108,154,274],"=":[109,275],"n/2":[110,156,276,301],"-":[111,157,197,277,302],"\\Omega":[112,278],"(\\sqrt":[113],"{n})$":[114],"We":[116,366],"first":[117],"provide":[118,214,248],"construction":[121,233],"cyclic":[123,240],"codes,":[124],"by":[125,282],"carefully":[126],"selecting":[127],"specific":[128],"roots":[129],"extension":[133],"field":[134],"check":[137],"polynomial,":[138],"with":[139,187,309],"notation=\"LaTeX\">$n=":[145],"2^{m}":[146],"-1$":[147],"\\geq":[155],"2^{c-1}\\sqrt":[158],"{n}$":[159],"notation=\"LaTeX\">$n^{c+1/2}$":[167],"any":[170,179],"notation=\"LaTeX\">$m\\geq":[175],"4$":[176],"integer":[180],"notation=\"LaTeX\">$c$":[185],"notation=\"LaTeX\">$0":[192],"\\leq":[193,195],"c":[194],"m/2":[196],"1$":[198],"These":[200],"parameters":[202],"are":[203,319],"slightly":[204],"worse":[205],"than":[206],"those":[207],"Delsarte\u2013Goethals":[210],"(DG)":[211],"codes":[212,241,246],"that":[213,242,321,353,369],"previously":[216,349],"known":[217,350],"best":[218,250,333],"bound":[220,252,339,352,372,378],"regime.":[225,365,384],"However,":[226],"using":[227],"similar":[229],"extended":[231],"technique":[234],"show":[236],"sequence":[238],"improve":[243],"upon":[244,374],"DG":[245],"narrower":[255],"range":[256],"(n^{2/3})$":[279],"Furthermore,":[281],"leveraging":[283],"Fourier-analytic":[285],"view":[286],"Delsarte\u2019s":[288],"linear":[289],"program,":[290],"\\left":[299],"\\lceil{":[300],"\\rho":[303],"\\sqrt":[304],"{n}\\,":[305],"}\\right":[306],"\\rceil)$":[307],"notation=\"LaTeX\">$\\rho":[314],"\\in":[315],"(0.5,":[316],"9.5)$":[317],"obtained":[320],"scale":[322,354],"polynomially":[323,355],"To":[331],"authors\u2019":[335],"knowledge,":[336],"due":[340],"Barg":[342],"Nogin":[344],"(2006)":[345],"only":[348],"numerically":[367],"demonstrate":[368],"our":[370],"improves":[373],"Barg-Nogin":[376],"specified":[381],"high-minimum":[382]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}