Renming Qi, Chen Feng, Yu-Chih Huang. A simpler proof for the existence of capacity-achieving nested lattice codes. In 2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, November 6-10, 2017. pages 564-568, IEEE, 2017. [doi]
@inproceedings{QiFH17,
title = {A simpler proof for the existence of capacity-achieving nested lattice codes},
author = {Renming Qi and Chen Feng and Yu-Chih Huang},
year = {2017},
doi = {10.1109/ITW.2017.8277953},
url = {https://doi.org/10.1109/ITW.2017.8277953},
researchr = {https://researchr.org/publication/QiFH17},
cites = {0},
citedby = {0},
pages = {564-568},
booktitle = {2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, November 6-10, 2017},
publisher = {IEEE},
isbn = {978-1-5090-3097-2},
}