{"year":"2021","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"isi":1,"external_id":{"arxiv":["2011.12882"],"isi":["000701502201029"]},"publication_identifier":{"eisbn":["978-1-5386-8209-8"],"isbn":["978-1-5386-8210-4"]},"author":[{"first_name":"Dorsa","last_name":"Fathollahi","full_name":"Fathollahi, Dorsa"},{"last_name":"Farsad","first_name":"Nariman","full_name":"Farsad, Nariman"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"}],"publication":"2021 IEEE International Symposium on Information Theory","doi":"10.1109/isit45174.2021.9517887","page":"1082-1087","_id":"10597","language":[{"iso":"eng"}],"conference":{"end_date":"2021-07-20","location":"Virtual, Melbourne, Australia","name":"ISIT: International Symposium on Information Theory","start_date":"2021-07-12"},"citation":{"ieee":"D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder recursive projection aggregation for Reed-Muller codes,” in 2021 IEEE International Symposium on Information Theory, Virtual, Melbourne, Australia, 2021, pp. 1082–1087.","mla":"Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 1082–87, doi:10.1109/isit45174.2021.9517887.","short":"D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 1082–1087.","ama":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In: 2021 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers; 2021:1082-1087. doi:10.1109/isit45174.2021.9517887","ista":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 1082–1087.","apa":"Fathollahi, D., Farsad, N., Hashemi, S. A., & Mondelli, M. (2021). Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In 2021 IEEE International Symposium on Information Theory (pp. 1082–1087). Virtual, Melbourne, Australia: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/isit45174.2021.9517887","chicago":"Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” In 2021 IEEE International Symposium on Information Theory, 1082–87. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/isit45174.2021.9517887."},"publisher":"Institute of Electrical and Electronics Engineers","scopus_import":"1","oa_version":"Preprint","oa":1,"date_created":"2022-01-03T11:31:26Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes","quality_controlled":"1","status":"public","month":"09","article_processing_charge":"No","date_updated":"2024-09-10T13:03:18Z","type":"conference","day":"01","department":[{"_id":"MaMo"}],"abstract":[{"lang":"eng","text":"We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation (CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral Fellowship from NSERC."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.12882"}],"publication_status":"published","date_published":"2021-09-01T00:00:00Z"}