Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier. List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006. pages 138-142, IEEE, 2006. [doi]
@inproceedings{DumerKT06,
title = {List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity},
author = {Ilya Dumer and Grigory Kabatiansky and Cédric Tavernier},
year = {2006},
doi = {10.1109/ISIT.2006.261690},
url = {https://doi.org/10.1109/ISIT.2006.261690},
researchr = {https://researchr.org/publication/DumerKT06},
cites = {0},
citedby = {0},
pages = {138-142},
booktitle = {Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006},
publisher = {IEEE},
isbn = {1-4244-0504-1},
}