A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear network coding, a near-to-optimal broadcasting scheme, called index-coded Automatic Repeat Request (ARQ) is proposed. The main idea is to consider the principal packet error pattern across all receivers. With the help of coded side informationdoi:10.3390/e22080869 pmid:33286639 fatcat:dbcku6viazemroehd32o7ltzx4