Paper Info
Title
Revolving Codes: Overhead and Computational Complexity Analysis
Abstract
Revolving codes (ReC) are a new family of network codes 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 the total overhead and decoding probability of a set of ReCs, and ii) efficient encoders and decoders. Our analysis shows that ReC decoders' number of multiplications scales as O(g) where g is the number of data packets being combined. In practice, this translates in several orders of magnitude fewer multiplications, half the number of additions, and lower transmission overheads compared to RLNC.
Year
DOI
Venue
2021
10.1109/LCOMM.2020.3027875
IEEE Communications Letters
Keywords
DocType
Volume
Network coding,complexity,overhead
Journal
25
Issue
ISSN
Citations 
2
1089-7798
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Niloofar Yazdani101.69
Daniel E. Lucani223642.29