{"id":"https://openalex.org/W2045476715","doi":"https://doi.org/10.1109/tit.2014.2340869","title":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem","display_name":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem","publication_year":2014,"publication_date":"2014-07-30","ids":{"openalex":"https://openalex.org/W2045476715","doi":"https://doi.org/10.1109/tit.2014.2340869","mag":"2045476715"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2014.2340869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2340869","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/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Per Austrin","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden","KTH Royal Institute of Technology; Stockholm Sweden"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH Royal Institute of Technology; Stockholm Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University, New York, NY, USA","New York University New York NY USA"],"affiliations":[{"raw_affiliation_string":"New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]},{"raw_affiliation_string":"New York University New York NY USA","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055776088"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.10663761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"60","issue":"10","first_page":"6636","last_page":"6645"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9988999962806702,"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/T11130","display_name":"Coding theory and cryptography","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7384933829307556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7120368480682373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6009401082992554},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5449172854423523},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5259799361228943},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.514409601688385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49452540278434753},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.49336257576942444},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47668027877807617},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.451206773519516},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4322674870491028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17952045798301697},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12179073691368103}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7384933829307556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7120368480682373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6009401082992554},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5449172854423523},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5259799361228943},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.514409601688385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49452540278434753},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.49336257576942444},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47668027877807617},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.451206773519516},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4322674870491028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17952045798301697},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12179073691368103},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2014.2340869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2340869","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.751.2107","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.2107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1010.1481.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W57720693","https://openalex.org/W1599026900","https://openalex.org/W2008930715","https://openalex.org/W2014860393","https://openalex.org/W2019578639","https://openalex.org/W2034946612","https://openalex.org/W2052507736","https://openalex.org/W2056492141","https://openalex.org/W2078536889","https://openalex.org/W2080132708","https://openalex.org/W2086653003","https://openalex.org/W2110614437","https://openalex.org/W2111319461","https://openalex.org/W2118284443","https://openalex.org/W2125212199","https://openalex.org/W2144593761","https://openalex.org/W2148352980","https://openalex.org/W2169665116","https://openalex.org/W2293438091","https://openalex.org/W2399135883","https://openalex.org/W2611668233","https://openalex.org/W3102292552","https://openalex.org/W6602383322","https://openalex.org/W6635778417"],"related_works":["https://openalex.org/W2094360276","https://openalex.org/W373615522","https://openalex.org/W1610556314","https://openalex.org/W2230283315","https://openalex.org/W4238916473","https://openalex.org/W2907080524","https://openalex.org/W2410874278","https://openalex.org/W2237004660","https://openalex.org/W4300617464","https://openalex.org/W4307004527"],"abstract_inverted_index":{"We":[0,22],"present":[1],"a":[2,38,80,104],"simple":[3],"deterministic":[4,105],"gap-preserving":[5],"reduction":[6,29,40,68,76,106],"from":[7],"SAT":[8],"to":[9,26,30,44,102],"the":[10,28],"minimum":[11],"distance":[12],"of":[13],"code":[14],"problem":[15],"over":[16,32],"F":[17],"<sub":[18],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[19],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[20],".":[21],"also":[23],"show":[24],"how":[25,101],"extend":[27],"work":[31],"any":[33],"fixed":[34],"finite":[35],"field.":[36],"Previously,":[37,96],"randomized":[39],"was":[41,50,98],"known":[42,100],"due":[43],"Dumer,":[45],"Micciancio,":[46],"and":[47,55,93],"Sudan,":[48],"which":[49],"recently":[51],"derandomized":[52],"by":[53],"Cheng":[54],"Wan.":[56],"These":[57],"reductions":[58],"rely":[59],"on":[60],"highly":[61],"nontrivial":[62],"coding":[63],"theoretic":[64],"constructions,":[65],"whereas":[66],"our":[67,75],"is":[69],"elementary.":[70],"As":[71],"an":[72],"additional":[73],"feature,":[74],"gives":[77],"hardness":[78],"within":[79],"constant":[81,90],"factor":[82],"even":[83],"for":[84,107],"asymptotically":[85],"good":[86],"codes,":[87],"i.e.,":[88],"having":[89],"positive":[91],"rate":[92],"relative":[94],"distance.":[95],"it":[97],"not":[99],"achieve":[103],"such":[108],"codes.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}