Provided by: University of Northern Iowa
Date Added: Apr 2013
Channel coding alone is not sufficient to reliably transmit a message of finite length from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a Time-Division Multiple Access (TDMA) system paired with Automatic Repeat reQuest (ARQ) or Random Linear Network Coding (RLNC). The authors consider binary channel coding on a Binary Symmetric Channel (BSC) and qary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a central relay. They focus on finite block lengths and compare the expected throughputs of RLNC and TDMA.