Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network"

Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. ApostolopoulosIEEE Trans. Information Theory 2022 · DOI · OpenReview

Abstract

In the above article <xref ref-type="bibr" rid="ref1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[1]</xref> , 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.
BibTeX
@article{fong2022corrections,
  author = {Silas L. Fong and Ashish Khisti and Baochun Li and Wai-Tian Tan and Xiaoqing Zhu and John G. Apostolopoulos},
  title = {{Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network"}},
  journal = {IEEE Trans. Information Theory},
  year = {2022},
  doi = {10.1109/tit.2022.3165316},
}

Loading related content...

Figure