{"id":"https://openalex.org/W2066824675","doi":"https://doi.org/10.1109/isit.2013.6620280","title":"Bounds on polynomial-time list decoding of rank metric codes","display_name":"Bounds on polynomial-time list decoding of rank metric codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2066824675","doi":"https://doi.org/10.1109/isit.2013.6620280","mag":"2066824675"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620280","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://mediatum.ub.tum.de/node?id=1328998","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041962883","display_name":"Antonia Wachter-Zeh","orcid":"https://orcid.org/0000-0002-5174-1947"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["DE","IN"],"is_corresponding":true,"raw_author_name":"Antonia Wachter-Zeh","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology Delhi, New Delhi, India","Inst. of Commun. Eng., Univ. of Ulm, Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Inst. of Commun. Eng., Univ. of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041962883"],"corresponding_institution_ids":["https://openalex.org/I196349391","https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":1.4827,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.86281328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"19","issue":null,"first_page":"519","last_page":"523"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"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/rank","display_name":"Rank (graph theory)","score":0.7397286295890808},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.7165892720222473},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7051842212677002},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6895583868026733},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6814879179000854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6715856194496155},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5893376469612122},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5193877816200256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5106597542762756},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4997069835662842},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.42348435521125793},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4126896560192108},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.3990761339664459},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19799089431762695},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18945461511611938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14553716778755188},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.13376566767692566}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7397286295890808},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.7165892720222473},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7051842212677002},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6895583868026733},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6814879179000854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6715856194496155},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5893376469612122},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5193877816200256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5106597542762756},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4997069835662842},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.42348435521125793},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4126896560192108},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.3990761339664459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19799089431762695},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18945461511611938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14553716778755188},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.13376566767692566},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2013.6620280","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1328998","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1328998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/1328998","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1328998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400453","display_name":"mediaTUM \u2013 the media and publications repository of the Technical University Munich (Technical University Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W110150650","https://openalex.org/W1568510176","https://openalex.org/W1582484623","https://openalex.org/W1965969834","https://openalex.org/W1993359877","https://openalex.org/W2032431003","https://openalex.org/W2055060019","https://openalex.org/W2060439883","https://openalex.org/W2068593329","https://openalex.org/W2089272132","https://openalex.org/W2095418648","https://openalex.org/W2095547380","https://openalex.org/W2098313715","https://openalex.org/W2107712595","https://openalex.org/W2123061921","https://openalex.org/W2139145447","https://openalex.org/W2139416652","https://openalex.org/W2142293082","https://openalex.org/W2157915592","https://openalex.org/W2158464899","https://openalex.org/W2962976342","https://openalex.org/W3101800757","https://openalex.org/W3103399168","https://openalex.org/W6667924333"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W4302771537","https://openalex.org/W2740543340","https://openalex.org/W2119135810","https://openalex.org/W2951416090","https://openalex.org/W2105471374","https://openalex.org/W2008960744","https://openalex.org/W2014631828","https://openalex.org/W2142293082"],"abstract_inverted_index":{"This":[0,91],"contribution":[1],"provides":[2],"bounds":[3,118],"on":[4,106],"the":[5,71,77,80,88,111],"list":[6,18,72],"size":[7,73],"of":[8,38,64,79],"rank":[9,35,43,55,95,127],"metric":[10,36,56,96],"codes":[11,123],"in":[12,76,94,124],"order":[13],"to":[14],"understand":[15],"whether":[16],"polynomial-time":[17],"decoding":[19],"is":[20,29,74],"possible":[21],"or":[22],"not.":[23],"First,":[24],"an":[25],"exponential":[26,75],"upper":[27,102],"bound":[28,49,103,113],"derived,":[30],"which":[31],"holds":[32],"for":[33,82,114],"any":[34,83],"code":[37,57,81],"length":[39,65,78],"n":[40,66,107],"and":[41,108,126],"minimum":[42,89],"distance":[44],"d.":[45],"Second,":[46],"a":[47,54,100],"lower":[48],"proves":[50],"that":[51,70,93],"there":[52,97],"exists":[53],"over":[58],"F":[59],"<sub":[60],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[61],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">q</sub>":[62],"m":[63,68],"\u2264":[67],"such":[69],"radius":[84],"greater":[85],"than":[86],"half":[87],"distance.":[90],"implies":[92],"cannot":[98],"exist":[99],"polynomial":[101],"depending":[104],"only":[105],"d":[109],"as":[110],"Johnson":[112],"Hamming":[115,125],"metric.":[116,128],"These":[117],"reveal":[119],"significant":[120],"differences":[121],"between":[122]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}