A Class of Algebraic Rate-Compatible Codes for Loss Recovery in Packet Networks

In this paper, a new class of algebraic rate-compatible (ARC) codes is presented and its applications to packet networks are considered. The ARC codes can be encoded incrementally using Chinese remained theory and can be decoded using Gaussian elimination. The new codes cover a wide range of code rate from frac{1}{2} to 1 and are perfect rate compatible in this range. When operated on erasure channel, the new codes approach very close to the capacity and is better than LT codes for small packet number k. Simulation is carried out to evaluate the performance and the results indicate that ARC codes are suitable for bandwidth efficient applications.