Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss
Rafid Mahmood, Ahmed Badr, Ashish J. Khisti · IEEE Transactions on Information Theory · 2017
The burst rank loss network is an extension of the burst erasure channel, where the channel matrix between the sender and receiver becomes rank-deficient for a certain period of consecutive time-slots. We study streaming communication over the burst rank loss channel, propose a new class of codes, ROBIN codes, and establish their optimality. Our construction uses the maximum rank distance and maximum sum rank codes from previous works as constituent codes and combines them in a layered fashion. Our results generalize previous works on both the single-link and multiple-parallel-link streaming setups over burst erasure channels. We perform simulations over statistical network models to show that ROBIN codes attain low packet loss rates in comparison with the existing codes.