{"id":"https://openalex.org/W1974665627","doi":"https://doi.org/10.1109/isit.2010.5513670","title":"On the threshold of Maximum-Distance Separable codes","display_name":"On the threshold of Maximum-Distance Separable codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1974665627","doi":"https://doi.org/10.1109/isit.2010.5513670","mag":"1974665627"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-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/A5090571621","display_name":"Bruno Kindarji","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I205703379","display_name":"Institut Mines-T\u00e9l\u00e9com","ror":"https://ror.org/025vp2923","country_code":"FR","type":"facility","lineage":["https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Kindarji","raw_affiliation_strings":["Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","Sagem S\u00e9curit\u00e9, Osny, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I205703379"]},{"raw_affiliation_string":"Sagem S\u00e9curit\u00e9, Osny, France#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047867702","display_name":"G\u00e9rard Cohen","orcid":null},"institutions":[{"id":"https://openalex.org/I205703379","display_name":"Institut Mines-T\u00e9l\u00e9com","ror":"https://ror.org/025vp2923","country_code":"FR","type":"facility","lineage":["https://openalex.org/I205703379"]},{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gerard Cohen","raw_affiliation_strings":["Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","Institut Telecom/Telecom ParisTech, France"],"affiliations":[{"raw_affiliation_string":"Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I205703379"]},{"raw_affiliation_string":"Institut Telecom/Telecom ParisTech, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I205703379"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067956931","display_name":"Herv\u00e9 Chabanne","orcid":"https://orcid.org/0000-0002-5916-3387"},"institutions":[{"id":"https://openalex.org/I205703379","display_name":"Institut Mines-T\u00e9l\u00e9com","ror":"https://ror.org/025vp2923","country_code":"FR","type":"facility","lineage":["https://openalex.org/I205703379"]},{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Herve Chabanne","raw_affiliation_strings":["Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","Sagem S\u00e9curit\u00e9, Osny, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut T\u00e9l\u00e9com, T\u00e9l\u00e9com Paris Technology, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I205703379"]},{"raw_affiliation_string":"Sagem S\u00e9curit\u00e9, Osny, France#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090571621"],"corresponding_institution_ids":["https://openalex.org/I12356871","https://openalex.org/I205703379"],"apc_list":null,"apc_paid":null,"fwci":0.9021,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78991442,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1163","last_page":"1167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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.9987999796867371,"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/T10237","display_name":"Cryptography and Data Security","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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6073727607727051},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5332325100898743},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.5297273993492126},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5259494781494141},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5239831805229187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4898967146873474},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.48535218834877014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4810774028301239},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4577033519744873},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44583818316459656},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.43338748812675476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4307311773300171},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4289085865020752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4267951548099518},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.424469530582428},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34588682651519775},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.26154452562332153}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6073727607727051},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5332325100898743},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.5297273993492126},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5259494781494141},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5239831805229187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4898967146873474},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.48535218834877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4810774028301239},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4577033519744873},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44583818316459656},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.43338748812675476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4307311773300171},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4289085865020752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4267951548099518},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.424469530582428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34588682651519775},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.26154452562332153},{"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/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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W165222903","https://openalex.org/W1482300910","https://openalex.org/W1482728223","https://openalex.org/W1535038576","https://openalex.org/W2024417654","https://openalex.org/W2071763320","https://openalex.org/W2099434011","https://openalex.org/W2103236224","https://openalex.org/W2140406753","https://openalex.org/W2146078064","https://openalex.org/W2168219305","https://openalex.org/W6825680077"],"related_works":["https://openalex.org/W3088883112","https://openalex.org/W2293846540","https://openalex.org/W3021758908","https://openalex.org/W1798117689","https://openalex.org/W2127950068","https://openalex.org/W1976052006","https://openalex.org/W4285494694","https://openalex.org/W2121777163","https://openalex.org/W3085073875","https://openalex.org/W1675804769"],"abstract_inverted_index":{"Starting":[0],"from":[1,51,72],"a":[2,9,63,100,122],"practical":[3],"use":[4],"of":[5,21,28,36,59,65,99,109,131],"Reed-Solomon":[6,137],"codes":[7,134],"in":[8,13,45],"cryptographic":[10],"scheme":[11,30],"published":[12],"Indocrypt'09,":[14],"this":[15,29,52,93,149],"paper":[16],"deals":[17],"with":[18],"the":[19,34,46,73,76,96,106,110,115,129,141,144],"threshold":[20,98,116,130,142],"linear":[22],"q-ary":[23],"error-correcting":[24],"codes.":[25],"The":[26],"security":[27],"is":[31,41,61,79,85,112,118],"based":[32],"on":[33,128],"intractability":[35],"polynomial":[37],"reconstruction":[38],"when":[39,105],"there":[40,62],"too":[42],"much":[43],"noise":[44],"vector.":[47],"Our":[48],"approach":[49],"switches":[50],"paradigm":[53],"to":[54,95],"an":[55],"Information":[56],"Theoretical":[57],"point":[58],"view:":[60],"class":[64],"elements":[66],"that":[67,75,104,147],"are":[68],"so":[69],"far":[70],"away":[71],"code":[74,111],"list":[77],"size":[78],"always":[80],"superpolynomial?":[81],"Or,":[82],"dually":[83],"speaking,":[84],"Maximum-Likelihood":[86],"decoding":[87,97],"almost":[88],"surely":[89],"impossible?":[90],"We":[91],"relate":[92],"issue":[94],"code,":[101],"and":[102,139],"show":[103],"minimal":[107],"distance":[108],"high":[113],"enough,":[114],"effect":[117],"very":[119],"sharp.":[120],"In":[121],"second":[123],"part,":[124],"we":[125],"explicit":[126],"lower-bounds":[127],"Maximum-Distance":[132],"Separable":[133],"such":[135],"as":[136],"codes,":[138],"compute":[140],"for":[143],"toy":[145],"example":[146],"motivates":[148],"study.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}