{"volume":2022,"status":"public","citation":{"ieee":"N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558.","mla":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” 2022 IEEE International Symposium on Information Theory, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–58, doi:10.1109/ISIT50566.2022.9834829.","ista":"Polyanskii N, Zhang Y. 2022. List-decodable zero-rate codes for the Z-channel. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2553–2558.","chicago":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” In 2022 IEEE International Symposium on Information Theory, 2022:2553–58. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834829.","apa":"Polyanskii, N., & Zhang, Y. (2022). List-decodable zero-rate codes for the Z-channel. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2553–2558). Espoo, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834829","ama":"Polyanskii N, Zhang Y. List-decodable zero-rate codes for the Z-channel. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2553-2558. doi:10.1109/ISIT50566.2022.9834829","short":"N. Polyanskii, Y. Zhang, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–2558."},"day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","page":"2553-2558","title":"List-decodable zero-rate codes for the Z-channel","year":"2022","abstract":[{"lang":"eng","text":"This paper studies combinatorial properties of codes for the Z-channel. A Z-channel with error fraction τ takes as input a length-n binary codeword and injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L − 1)-list-decodable code for the Z-channel with error fraction τ has exponential (in n) size if τ is less than a critical value that we call the Plotkin point and has constant size if τ is larger than the threshold. The (L−1)-list-decoding Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest (L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for any L − 1 ≥ 1."}],"publisher":"Institute of Electrical and Electronics Engineers","oa_version":"None","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"month":"08","doi":"10.1109/ISIT50566.2022.9834829","publication_status":"published","author":[{"full_name":"Polyanskii, Nikita","last_name":"Polyanskii","first_name":"Nikita"},{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","last_name":"Zhang","first_name":"Yihan"}],"publication":"2022 IEEE International Symposium on Information Theory","date_published":"2022-08-03T00:00:00Z","quality_controlled":"1","department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}],"intvolume":" 2022","scopus_import":"1","conference":{"end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory","location":"Espoo, Finland","start_date":"2022-06-26"},"article_processing_charge":"No","date_created":"2022-09-04T22:02:07Z","date_updated":"2023-02-13T09:02:18Z","_id":"12019"}