Abstract:
In the above article [1], an upper bound on the maximum achievable rate is corrected. If we add the restriction that the packets transmitted by the relay must be independ...Show MoreMetadata
Abstract:
In the above article [1], an upper bound on the maximum achievable rate is corrected. If we add the restriction that the packets transmitted by the relay must be independent of the erasures introduced by the first-hop channel, then no correction is needed and the converse proof need not be rectified.
Published in: IEEE Transactions on Information Theory ( Volume: 68, Issue: 10, October 2022)