{"id":"https://openalex.org/W1989168989","doi":"https://doi.org/10.1109/tit.2015.2389248","title":"On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes","display_name":"On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes","publication_year":2015,"publication_date":"2015-01-09","ids":{"openalex":"https://openalex.org/W1989168989","doi":"https://doi.org/10.1109/tit.2015.2389248","mag":"1989168989"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2015.2389248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2389248","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/A5040504830","display_name":"Peter Nelson","orcid":"https://orcid.org/0000-0003-4108-635X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Peter Nelson","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046528024","display_name":"Stefan H. M. van Zwam","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stefan H. M. van Zwam","raw_affiliation_strings":["Department of Mathematics, Louisiana State University, Baton Rouge, LA, USA","Department of Mathematics, Louisiana State University, Baton Rouge, LA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]},{"raw_affiliation_string":"Department of Mathematics, Louisiana State University, Baton Rouge, LA USA","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6256,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91784639,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"61","issue":"3","first_page":"1153","last_page":"1158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9990000128746033,"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.9990000128746033,"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.9979000091552734,"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.9711999893188477,"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/code","display_name":"Code (set theory)","score":0.416145384311676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3593881130218506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3336350917816162},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09744176268577576},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.05217704176902771}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.416145384311676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3593881130218506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3336350917816162},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09744176268577576},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.05217704176902771}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2015.2389248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2389248","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/G4045551672","display_name":null,"funder_award_id":"1161650","funder_id":"https://openalex.org/F4320337380","funder_display_name":"Division of Mathematical Sciences"}],"funders":[{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2035409201","https://openalex.org/W2058374373","https://openalex.org/W2115769160","https://openalex.org/W2949844502","https://openalex.org/W4231868828","https://openalex.org/W4301425258","https://openalex.org/W6643908614"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"Let":[0],"C":[1,45,80,102,109],"=":[2],"(C1,":[3],"C2,":[4],"...)":[5],"be":[6],"a":[7,15,82,119],"sequence":[8],"of":[9,30,71,84],"codes":[10,74,86],"such":[11],"that":[12,44,78],"each":[13],"Ciis":[14],"linear":[16],"[ni,":[17],"ki,":[18],"di]-code":[19],"over":[20],"some":[21,51],"fixed":[22],"finite":[23],"field":[24],"F,":[25],"where":[26],"niis":[27],"the":[28,31,35,39],"length":[29],"code":[32],"words,":[33],"kiis":[34],"dimension,":[36],"and":[37,55,65,91,98,100],"diis":[38],"minimum":[40],"distance.":[41],"We":[42,76],"say":[43],"is":[46,81,89],"asymptotically":[47,72,105],"good":[48,73,106],"if,":[49],"for":[50,56],"\u03b5":[52],">":[53],"0":[54],"all":[57,112],"i":[58,64],"\u2208":[59],"\u2124>0,":[60],"we":[61],"have":[62],"ni\u2265":[63],"min(ki/ni,":[66],"di/ni)":[67],"\u2265":[68,93],"\u03b5.":[69],"Sequences":[70],"exist.":[75],"prove":[77],"if":[79,101],"class":[83],"GF(pn)-linear":[85],"(where":[87],"p":[88],"prime":[90],"n":[92],"1),":[94],"closed":[95],"under":[96],"puncturing":[97],"shortening,":[99],"contains":[103],"an":[104],"sequence,":[107],"then":[108],"must":[110],"contain":[111],"GF(p)-linear":[113],"codes.":[114],"Our":[115],"proof":[116],"relies":[117],"on":[118],"powerful":[120],"new":[121],"result":[122],"from":[123],"matroid":[124],"structure":[125],"theory.":[126]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}