Revolving Codes: Overhead and Computational Complexity Analysis

Revolving codes (ReC) are a new family of network that reduce signaling overhead and maintain high decoding probability, which is key in applications with small payloads, e.g., IoT, Industry 4.0. However, they have only been studied using simulations. We present i) the first exact mathematical model for total probability set ReCs, ii) efficient encoders decoders. Our analysis shows ReC decoders' number multiplications scales as O(g) where g data packets being combined. In practice, this translates several orders magnitude fewer multiplications, half additions, lower transmission overheads compared to RLNC.