{"id":"https://openalex.org/W4401879696","doi":"https://doi.org/10.1109/tit.2024.3449899","title":"A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions","display_name":"A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions","publication_year":2024,"publication_date":"2024-08-26","ids":{"openalex":"https://openalex.org/W4401879696","doi":"https://doi.org/10.1109/tit.2024.3449899"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2024.3449899","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tit.2024.3449899","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/A5060351425","display_name":"Hao Chen","orcid":"https://orcid.org/0000-0002-4558-8982"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Chen","raw_affiliation_strings":["College of Information Science and Technology/Cyber Security, Jinan University, Guangzhou, Guangdong, China"],"raw_orcid":"https://orcid.org/0000-0002-4558-8982","affiliations":[{"raw_affiliation_string":"College of Information Science and Technology/Cyber Security, Jinan University, Guangzhou, Guangdong, China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087435772","display_name":"C. Xie","orcid":"https://orcid.org/0009-0004-0249-9519"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Conghui Xie","raw_affiliation_strings":["College of Information Science and Technology/Cyber Security, Jinan University, Guangzhou, Guangdong, China"],"raw_orcid":"https://orcid.org/0009-0004-0249-9519","affiliations":[{"raw_affiliation_string":"College of Information Science and Technology/Cyber Security, Jinan University, Guangzhou, Guangdong, China","institution_ids":["https://openalex.org/I159948400"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I159948400"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1003988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"12","first_page":"8713","last_page":"8722"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9821000099182129,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.974399983882904,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.635551393032074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5803871154785156},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4103041887283325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.342447429895401},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30878734588623047},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.25611746311187744},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.22470587491989136},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.19597652554512024}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.635551393032074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5803871154785156},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4103041887283325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.342447429895401},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30878734588623047},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.25611746311187744},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.22470587491989136},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.19597652554512024}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2024.3449899","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tit.2024.3449899","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/10","display_name":"Reduced inequalities","score":0.550000011920929}],"awards":[{"id":"https://openalex.org/G6816960198","display_name":null,"funder_award_id":"62032009","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1530125006","https://openalex.org/W1606480398","https://openalex.org/W1901450070","https://openalex.org/W1965097372","https://openalex.org/W1973483608","https://openalex.org/W1984633059","https://openalex.org/W1998161405","https://openalex.org/W2009160369","https://openalex.org/W2015337464","https://openalex.org/W2017740623","https://openalex.org/W2022560477","https://openalex.org/W2033633322","https://openalex.org/W2035513039","https://openalex.org/W2051788381","https://openalex.org/W2056890992","https://openalex.org/W2080231105","https://openalex.org/W2083774980","https://openalex.org/W2101226255","https://openalex.org/W2146977227","https://openalex.org/W2163834165","https://openalex.org/W2231447873","https://openalex.org/W2569430158","https://openalex.org/W2787162447","https://openalex.org/W2951121006","https://openalex.org/W2962947453","https://openalex.org/W2963243225","https://openalex.org/W2964238317","https://openalex.org/W3009473154","https://openalex.org/W3021289972","https://openalex.org/W3034275020","https://openalex.org/W3099803362","https://openalex.org/W3127046705","https://openalex.org/W3194802667","https://openalex.org/W3216147140","https://openalex.org/W4206775542","https://openalex.org/W4210773086","https://openalex.org/W4213104090","https://openalex.org/W4229826396","https://openalex.org/W4239704585","https://openalex.org/W4295308639","https://openalex.org/W4296558673","https://openalex.org/W4381415883","https://openalex.org/W4384787895","https://openalex.org/W4385864182","https://openalex.org/W4390097428","https://openalex.org/W4390357328","https://openalex.org/W4390421862","https://openalex.org/W6804434002","https://openalex.org/W6844394356"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W832867880","https://openalex.org/W2147254059","https://openalex.org/W4386066307","https://openalex.org/W917159298"],"abstract_inverted_index":{"In":[0],"this":[1,62],"paper,":[2],"we":[3,78,118],"give":[4,119],"a":[5,25,93],"new":[6],"upper":[7],"bound":[8,63,67,73],"on":[9,149],"sizes":[10],"of":[11,18,37,54,85,105,152,155],"linear":[12,55,75,129],"codes":[13,19,56,158,164],"related":[14],"to":[15],"weight":[16,36,111,122],"distributions":[17,112],"as":[20],"follows.":[21],"Let":[22],"C":[23,40],"be":[24],"linear$[n,k,d]_{q}$code,":[26,94],"such":[27,103],"that,":[28],"between":[29],"d":[30],"and$d\\left":[31],"({{1+\\frac":[32,44,49],"{1}{q-1}}}\\right)-1$,":[33],"the":[34,42,71,88,101,150],"largest":[35],"codewords":[38],"in":[39,87],"is":[41,68,82,100],"weight$d\\left":[43],"{1}{q-1}}}\\right)-1-v$,":[45],"then$k":[46],"\\leq":[47],"n-d\\left":[48],"{1}{q-1}}}\\right)+2+v$.":[50],"Some":[51],"infinite":[52],"families":[53],"with":[57],"arbitrary":[58],"minimum":[59],"distances":[60],"attaining":[61],"are":[64,165],"constructed.":[65],"This":[66,99],"stronger":[69],"than":[70],"Singleton":[72,162],"for":[74,125],"codes.":[76,146],"Hence":[77],"prove":[79],"that":[80],"there":[81],"no":[83],"codeword":[84],"weights":[86,154],"range$\\left":[89],"[{{\\frac":[90],"{qd}{q-1}-v,\\frac":[91],"{qd}{q-1}-1}}\\right]$for":[92],"if$v=\\frac":[95],"{qd}{q-1}+k-n-2":[96],"\\geq":[97],"2$.":[98],"first":[102],"kind":[104],"result,":[106],"which":[107],"concludes":[108],"vanishing":[109,120],"partial":[110,121],"from":[113],"four":[114],"parameters$n,k,d$and":[115],"q.":[116],"Then":[117],"distribution":[123],"results":[124],"many":[126],"best":[127],"known":[128],"codes,":[130,134,139,142],"some":[131,140,144,160],"almost":[132],"MDS":[133],"general":[135],"small":[136,161],"Griesmer":[137,157],"defect":[138,163],"BCH":[141],"and":[143,159],"cyclic":[145],"Upper":[147],"bounds":[148],"number":[151],"nonzero":[153],"binary":[156],"also":[166],"given.":[167]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}