On recursive decoding with sublinear complexity for Reed-Muller codes

Ilya Dumer. On recursive decoding with sublinear complexity for Reed-Muller codes. In Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003. pages 14-17, IEEE, 2003. [doi]

@inproceedings{Dumer03,
  title = {On recursive decoding with sublinear complexity for Reed-Muller codes},
  author = {Ilya Dumer},
  year = {2003},
  doi = {10.1109/ITW.2003.1216683},
  url = {https://doi.org/10.1109/ITW.2003.1216683},
  researchr = {https://researchr.org/publication/Dumer03},
  cites = {0},
  citedby = {0},
  pages = {14-17},
  booktitle = {Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003},
  publisher = {IEEE},
  isbn = {0-7803-7799-0},
}