[{"external_id":{"arxiv":[]},"author":[{"first_name":"Arman","last_name":"Fazeli"},{"first_name":"Hamed","last_name":"Hassani"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"last_name":"Vardy","first_name":"Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","dini_type":"doc-type:conferenceObject","citation":{"chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018 IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory Workshop. ITW: Information Theory Workshop, 1–5.","mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5, doi:10.1109/itw.2018.8613428.","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5.","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information Theory Workshop, Guangzhou, China, 2018, pp. 1–5.","apa":"Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428"},"oa":1,"quality_controlled":"1","date_created":"2019-07-23T11:01:42Z","date_published":"2018-11-01T00:00:00Z","page":"1-5","uri_base":"https://research-explorer.ista.ac.at","publication":"2018 IEEE Information Theory Workshop","dc":{"source":["Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop. IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1109/itw.2018.8613428","info:eu-repo/semantics/altIdentifier/arxiv/1711.01339"],"description":["We prove that, at least for the binary erasure channel, the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but, in fact, do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure reliable communication at rates within ε > 0 of capacity with block length n = O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n)."],"identifier":["https://research-explorer.ista.ac.at/record/6665"],"date":["2018"],"publisher":["IEEE"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text","http://purl.org/coar/resource_type/c_5794"],"creator":["Fazeli, Arman","Hassani, Hamed","Mondelli, Marco","Vardy, Alexander"],"rights":["info:eu-repo/semantics/openAccess"],"language":["eng"],"title":["Binary linear codes with optimal scaling: Polar codes with large kernels"]},"day":"01","status":"public","conference":{"end_date":"2018-11-29","location":"Guangzhou, China","start_date":"2018-11-25","name":"ITW: Information Theory Workshop"},"type":"conference","_id":"6665","extern":"1","creator":{"id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","login":"apreinsp"},"date_updated":"2024-03-07T12:18:50Z","month":"11","main_file_link":[{"url":"https://arxiv.org/abs/1711.01339","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng"}],"related_material":{"record":[{"status":"public","id":"9002","relation":"later_version"}]},"language":[{}],"publication_status":"published"}]