{"language":[{"iso":"eng"}],"date_updated":"2023-02-23T12:56:49Z","date_created":"2019-07-24T09:10:38Z","publication_identifier":{"eissn":["2157-8117"]},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"full_name":"Urbanke, Rudiger","first_name":"Rudiger","last_name":"Urbanke"}],"external_id":{"arxiv":["1801.03153"]},"title":"A new coding paradigm for the primitive relay channel","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6675","year":"2018","day":"16","page":"351-355","quality_controlled":"1","doi":"10.1109/isit.2018.8437479","publication_status":"published","type":"conference","citation":{"ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in <i>2018 IEEE International Symposium on Information Theory</i>, Vail, CO, United States, 2018, pp. 351–355.","short":"M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In <i>2018 IEEE International Symposium on Information Theory</i>, 351–55. IEEE, 2018. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>.","ama":"Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: <i>2018 IEEE International Symposium on Information Theory</i>. IEEE; 2018:351-355. doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In <i>2018 IEEE International Symposium on Information Theory</i> (pp. 351–355). Vail, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” <i>2018 IEEE International Symposium on Information Theory</i>, IEEE, 2018, pp. 351–55, doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive relay channel. 2018 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory , 351–355."},"publisher":"IEEE","month":"06","publication":"2018 IEEE International Symposium on Information Theory","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1801.03153"}],"extern":"1","related_material":{"record":[{"id":"7007","relation":"later_version","status":"public"}]},"oa_version":"Preprint","date_published":"2018-06-16T00:00:00Z","conference":{"start_date":"2018-06-17","end_date":"2018-06-22","location":"Vail, CO, United States","name":"ISIT: International Symposium on Information Theory "},"abstract":[{"lang":"eng","text":"We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and- forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds."}],"status":"public","oa":1}