{"id":"https://openalex.org/W2745250886","doi":"https://doi.org/10.1109/isit.2017.8006811","title":"An improved bound on the zero-error list-decoding capacity of the 4/3 channel","display_name":"An improved bound on the zero-error list-decoding capacity of the 4/3 channel","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2745250886","doi":"https://doi.org/10.1109/isit.2017.8006811","mag":"2745250886"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/11379/498157","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037433671","display_name":"Marco Dalai","orcid":"https://orcid.org/0000-0003-2132-7072"},"institutions":[{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Dalai","raw_affiliation_strings":["University of Brescia, Brescia, Italy"],"affiliations":[{"raw_affiliation_string":"University of Brescia, Brescia, Italy","institution_ids":["https://openalex.org/I79940851"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066679426","display_name":"Venkatesan Guruswami Carnegie","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami Carnegie","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, US"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, US","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080324608","display_name":"Jaikumar Radhakrishnan","orcid":"https://orcid.org/0000-0002-3875-4620"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jaikumar Radhakrishnan","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037433671"],"corresponding_institution_ids":["https://openalex.org/I79940851"],"apc_list":null,"apc_paid":null,"fwci":1.4504,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8464061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1658","last_page":"1662"},"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.9926000237464905,"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.9926000237464905,"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.9894999861717224,"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.9883000254631042,"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/list-decoding","display_name":"List decoding","score":0.7607393264770508},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7138151526451111},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.686339259147644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6586645245552063},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6137347221374512},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5890033841133118},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5430178046226501},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5337072014808655},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5058417320251465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.502037763595581},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.4814859628677368},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47035670280456543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.457424521446228},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42364639043807983},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.3241727352142334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3210686445236206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29493337869644165},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.23353901505470276},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21358424425125122},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.18647554516792297},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.18245980143547058}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7607393264770508},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7138151526451111},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.686339259147644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6586645245552063},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6137347221374512},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5890033841133118},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5430178046226501},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5337072014808655},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5058417320251465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.502037763595581},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.4814859628677368},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47035670280456543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.457424521446228},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42364639043807983},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.3241727352142334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3210686445236206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29493337869644165},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.23353901505470276},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21358424425125122},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.18647554516792297},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.18245980143547058},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unibs.it:11379/498157","is_oa":true,"landing_page_url":"https://hdl.handle.net/11379/498157","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unibs.it:11379/498157","is_oa":true,"landing_page_url":"https://hdl.handle.net/11379/498157","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"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":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1980392009","https://openalex.org/W1997218732","https://openalex.org/W2029773437","https://openalex.org/W2034215849","https://openalex.org/W2045394325","https://openalex.org/W2053816258","https://openalex.org/W2056884477","https://openalex.org/W2078289947","https://openalex.org/W2164684058","https://openalex.org/W3090398476","https://openalex.org/W4285719527","https://openalex.org/W6633706167","https://openalex.org/W6783798015"],"related_works":["https://openalex.org/W2138593246","https://openalex.org/W2190053471","https://openalex.org/W3157123936","https://openalex.org/W2963821790","https://openalex.org/W2031570691","https://openalex.org/W2745250886","https://openalex.org/W2083233139","https://openalex.org/W4320722052","https://openalex.org/W4309129943","https://openalex.org/W1965969834"],"abstract_inverted_index":{"We":[0],"prove":[1],"a":[2,31,42,120,143],"new,":[3],"improved":[4,82],"upper":[5,71],"bound":[6,72,85],"on":[7,127],"the":[8,21,68,83,128],"size":[9,45,148],"of":[10,73,147],"codes":[11,118,141],"C":[12,29,151],"\u2286{1,":[13],"2,":[14,154],"3,":[15,155],"4}":[16],"<sup":[17,49],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[18,50],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[19],"with":[20,124],"property":[22],"that":[23,40,86],"every":[24],"four":[25],"distinct":[26],"codewords":[27],"in":[28,64,80],"have":[30],"coordinate":[32],"where":[33,116,139],"they":[34],"all":[35],"differ.":[36],"Specifically,":[37],"we":[38],"show":[39],"such":[41,117,140],"code":[43],"has":[44,56],"at":[46],"most":[47],"2":[48],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">6n/19":[51],"+o(n)</sup>":[52],",":[53],"or":[54],"equivalently":[55],"rate":[57],"bounded":[58],"by":[59],"6/19":[60],"\u2264":[61],"0.3158":[62],"(measured":[63],"bits).":[65],"This":[66],"improves":[67],"previous":[69],"best":[70],"0.3512":[74],"due":[75,94],"to":[76,95,122,152],"(Arikan":[77],"1994),":[78],"which":[79],"turn":[81],"0.375":[84],"followed":[87],"from":[88],"general":[89],"bounds":[90],"for":[91,107],"perfect":[92,137,144],"hashing":[93],"(Fredman":[96],"and":[97,100,102,136],"Komlos,":[98],"1984)":[99],"(Korner":[101],"Marton,":[103],"1988).":[104],"The":[105],"context":[106],"this":[108],"problem":[109],"is":[110,134],"two-fold:":[111],"zero-error":[112],"list":[113],"decoding":[114,133],"capacity,":[115],"give":[119,142],"way":[121],"communicate":[123],"no":[125],"error":[126],"\u201c4/3":[129],"channel\u201d":[130],"when":[131],"list-of-3":[132],"employed,":[135],"hashing,":[138],"hash":[145],"family":[146],"n":[149],"mapping":[150],"{1,":[153],"4}.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}