@inproceedings{4176d99612b54b1cba0111b1815494a4,
title = "Low complexity schemes for the random access Gaussian channel",
abstract = "We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.",
author = "Or Ordentlich and Yury Polyanskiy",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8006985",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2528--2532",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "الولايات المتّحدة",
}