Memory-Efficient Segment-Based Packet-Combining Schemes in Face of Deadlines
Andreas Willig · IEEE Transactions on Industrial Informatics · 2009
In this paper, we consider segment-based hard-decision packet-combining schemes. The schemes presented here are memory-efficient and easy to implement, and some of them approach the performance of majority-voting schemes without having the same memory requirements. One particularly interesting scheme combines segment-based transmission with Luby-type erasure codes.