{"id":"https://openalex.org/W1628996527","doi":"https://doi.org/10.1109/isit.2015.7282407","title":"List and probabilistic unique decoding of folded subspace codes","display_name":"List and probabilistic unique decoding of folded subspace codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1628996527","doi":"https://doi.org/10.1109/isit.2015.7282407","mag":"1628996527"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282407","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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/A5054665295","display_name":"Hannes Bartz","orcid":"https://orcid.org/0000-0001-7767-1513"},"institutions":[{"id":"https://openalex.org/I174004417","display_name":"Munich University of Applied Sciences","ror":"https://ror.org/012k1v959","country_code":"DE","type":"education","lineage":["https://openalex.org/I174004417"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hannes Bartz","raw_affiliation_strings":["Institute for Communications Engineering Technische, Universit\u00e4t M\u00fcnchen Munich, Germany","[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering Technische, Universit\u00e4t M\u00fcnchen Munich, Germany","institution_ids":["https://openalex.org/I62916508","https://openalex.org/I174004417"]},{"raw_affiliation_string":"[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072164594","display_name":"Vladimir Sidorenko","orcid":"https://orcid.org/0000-0003-4966-3684"},"institutions":[{"id":"https://openalex.org/I174004417","display_name":"Munich University of Applied Sciences","ror":"https://ror.org/012k1v959","country_code":"DE","type":"education","lineage":["https://openalex.org/I174004417"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vladimir Sidorenko","raw_affiliation_strings":["Institute for Communications Engineering Technische, Universit\u00e4t M\u00fcnchen Munich, Germany","[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering Technische, Universit\u00e4t M\u00fcnchen Munich, Germany","institution_ids":["https://openalex.org/I62916508","https://openalex.org/I174004417"]},{"raw_affiliation_string":"[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054665295"],"corresponding_institution_ids":["https://openalex.org/I174004417","https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":1.4045,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83424392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11130","display_name":"Coding theory and cryptography","score":0.9958000183105469,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9855999946594238,"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/list-decoding","display_name":"List decoding","score":0.9116551876068115},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8345392942428589},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6357170343399048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6116006374359131},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5726369023323059},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5695140957832336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5514338612556458},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5117292404174805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4307180643081665},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41679805517196655},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.40353310108184814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39102935791015625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33965200185775757},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2777206599712372},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09513750672340393}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.9116551876068115},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8345392942428589},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6357170343399048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6116006374359131},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5726369023323059},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5695140957832336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5514338612556458},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5117292404174805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4307180643081665},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41679805517196655},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.40353310108184814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39102935791015625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33965200185775757},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2777206599712372},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09513750672340393},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282407","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1628996527","https://openalex.org/W1663773594","https://openalex.org/W1667411252","https://openalex.org/W1720244689","https://openalex.org/W1965969834","https://openalex.org/W1996310087","https://openalex.org/W1999418148","https://openalex.org/W2013452229","https://openalex.org/W2031971033","https://openalex.org/W2055060019","https://openalex.org/W2060439883","https://openalex.org/W2068593329","https://openalex.org/W2108430099","https://openalex.org/W2123061921","https://openalex.org/W2139416652","https://openalex.org/W2167890515","https://openalex.org/W2396095037","https://openalex.org/W6637162345","https://openalex.org/W6637296345","https://openalex.org/W6637604714","https://openalex.org/W6667924333"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2127999627","https://openalex.org/W2010879611"],"abstract_inverted_index":{"A":[0,121],"new":[1],"class":[2],"of":[3,109,124],"folded":[4],"subspace":[5,111],"codes":[6,14,112],"for":[7,25,38],"noncoherent":[8],"network":[9],"coding":[10],"is":[11,42,68,76,119,128],"presented.":[12],"The":[13,80],"can":[15],"correct":[16,47],"insertions":[17,48],"and":[18,49,72,113],"deletions":[19,50],"beyond":[20],"the":[21,53,69,105,115,125,137],"unique":[22,91,96,133],"decoding":[23,36,78,116,126,134,139],"radius":[24,55],"any":[26],"code":[27,40],"rate":[28],"R":[29],"\u2208":[30],"[0,":[31],"1].":[32],"An":[33,101],"efficient":[34],"interpolation-based":[35],"algorithm":[37,81],"this":[39],"construction":[41],"given":[43],"which":[44],"allows":[45],"to":[46,52,136],"up":[51,135],"normalized":[54],"s":[56,63,73],"(1":[57],"-":[58,62],"((1/h":[59],"+":[60,64],"h)/(h":[61],"1))R),":[65],"where":[66],"h":[67,75],"folding":[70],"parameter":[71],"\u2264":[74],"a":[77,84,89,95],"parameter.":[79],"serves":[82],"as":[83,88],"list":[85,107,138],"decoder":[86,92],"or":[87],"probabilistic":[90,132],"that":[93,129],"outputs":[94],"solution":[97],"with":[98],"high":[99],"probability.":[100],"upper":[102],"bound":[103],"on":[104,114],"average":[106],"size":[108],"(folded)":[110],"failure":[117],"probability":[118],"derived.":[120],"major":[122],"benefit":[123],"scheme":[127],"it":[130],"enables":[131],"radius.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}