{"id":"https://openalex.org/W2887087447","doi":"https://doi.org/10.1109/isit.2018.8437495","title":"Input-Output Distance Properties of Good Linear Codes","display_name":"Input-Output Distance Properties of Good Linear Codes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2887087447","doi":"https://doi.org/10.1109/isit.2018.8437495","mag":"2887087447"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437495","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/123481","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080988803","display_name":"Hajir Roozbehani","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Hajir Roozbehani","raw_affiliation_strings":["MIT"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["MIT"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080988803"],"corresponding_institution_ids":["https://openalex.org/I4210109586"],"apc_list":null,"apc_paid":null,"fwci":1.1704,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81467995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2510","last_page":"2514"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9991000294685364,"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/T11130","display_name":"Coding theory and cryptography","score":0.9987000226974487,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/overdetermined-system","display_name":"Overdetermined system","score":0.7617089748382568},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6537193059921265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6285701990127563},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5217331647872925},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5189880728721619},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5050652623176575},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4836033880710602},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.48355838656425476},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47472843527793884},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.4639330506324768},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37909260392189026},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35735398530960083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3213316798210144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2877160310745239},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.22864305973052979},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.21736672520637512}],"concepts":[{"id":"https://openalex.org/C81901731","wikidata":"https://www.wikidata.org/wiki/Q331348","display_name":"Overdetermined system","level":2,"score":0.7617089748382568},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6537193059921265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6285701990127563},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5217331647872925},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5189880728721619},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5050652623176575},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4836033880710602},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.48355838656425476},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47472843527793884},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4639330506324768},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37909260392189026},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35735398530960083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3213316798210144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2877160310745239},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.22864305973052979},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.21736672520637512},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2018.8437495","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/123481","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/123481","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/123481","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/123481","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1659060437","https://openalex.org/W2052181759","https://openalex.org/W2099727759","https://openalex.org/W2117492831","https://openalex.org/W2130649822","https://openalex.org/W2136780942","https://openalex.org/W2139714833","https://openalex.org/W2150182740","https://openalex.org/W2156452863","https://openalex.org/W2512422884","https://openalex.org/W2887087447","https://openalex.org/W2962692598","https://openalex.org/W2965725349","https://openalex.org/W4290758573","https://openalex.org/W4291432975","https://openalex.org/W6754028438"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2982774419","https://openalex.org/W2040876974","https://openalex.org/W2963549154","https://openalex.org/W1981727981","https://openalex.org/W2105471374","https://openalex.org/W2131611350","https://openalex.org/W2364868136","https://openalex.org/W2037696527","https://openalex.org/W1899695222"],"abstract_inverted_index":{"Consider":[0],"a":[1,6,107,139],"linear":[2,96,133],"code":[3],"defined":[4],"as":[5],"mapping":[7],"between":[8,64,85],"vector":[9],"spaces":[10],"of":[11,26,29,51,71,130,160],"dimensions":[12],"k":[13,136,161],"and":[14,66,87,94,171],"n.":[15],"Let":[16],"\u03b2*":[17,35,65,86],"denote":[18],"the":[19,37,62,68,72,76],"minimal":[20],"(relative)":[21],"weight":[22,32],"among":[23],"all":[24,95],"images":[25],"input":[27],"vectors":[28],"full":[30],"Hamming":[31],"k.":[33],"Operationally,":[34],"characterizes":[36],"threshold":[38,77],"for":[39,78,112],"adversarial":[40],"(erasure)":[41],"noise":[42],"beyond":[43],"which":[44,74],"decoder":[45],"is":[46,89,110,123,142,163,168],"guaranteed":[47],"to":[48,145,153],"produce":[49],"estimate":[50],"k-input":[52],"with":[53,114,150],"100%":[54],"symbol":[55],"error":[56],"rate":[57],"(SER).":[58],"This":[59,166],"paper":[60],"studies":[61],"relation":[63],"\u03b4,":[67],"minimum":[69],"distance":[70],"code,":[73],"gives":[75],"0":[79],"%":[80],"SER.":[81],"An":[82],"optimal":[83],"tradeoff":[84],"\u03b4":[88],"obtained":[90],"(over":[91,138],"large":[92],"alphabets)":[93],"codes":[97,113],"achieving":[98],"\u03b2*=1":[99],"are":[100,103],"classified:":[101],"they":[102],"repetition-like.":[104],"More":[105],"generally,":[106],"design":[108],"criteria":[109],"proposed":[111],"favorable":[115],"graceful":[116],"degradation":[117],"properties.":[118],"As":[119],"an":[120,127],"example,":[121],"it":[122,141],"shown":[124],"that":[125,157],"in":[126,135],"overdetermined":[128],"system":[129],"n":[131,174],"homogeneous":[132],"equations":[134,149,162],"variables":[137],"field)":[140],"always":[143],"possible":[144],"satisfy":[146],"some":[147],"k-1":[148],"non-zero":[151],"assignments":[152],"every":[154],"unknown,":[155],"provided":[156],"any":[158],"subset":[159],"linearly":[164],"independent.":[165],"statement":[167],"true":[169],"if":[170,173],"only":[172],"\u2265":[175],"2k-1.":[176]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}