Reeves, Galen, and Pfister, Henry D. Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity. IEEE Transactions on Information Theory 70.2 Web. doi:10.1109/TIT.2023.3286452.

Reeves, Galen, & Pfister, Henry D. Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity. IEEE Transactions on Information Theory, 70 (2). https://doi.org/10.1109/TIT.2023.3286452

Reeves, Galen, and Pfister, Henry D. "Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity". IEEE Transactions on Information Theory 70 (2). Country unknown/Code not available: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TIT.2023.3286452. https://par.nsf.gov/biblio/10486992.

@article{osti_10486992,
place = {Country unknown/Code not available}, title = {Reed–Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity}, url = {https://par.nsf.gov/biblio/10486992}, DOI = {10.1109/TIT.2023.3286452}, abstractNote = {Not Available}, journal = {IEEE Transactions on Information Theory}, volume = {70}, number = {2}, publisher = {Institute of Electrical and Electronics Engineers}, author = {Reeves, Galen and Pfister, Henry D.}, }