Abstract
Gabidulin codes and interleaved Gabidulin codes are rank-metric codes mainly used in network error correction and distributed storage. The current decoding algorithm for both codes relies on linearized shift register (LSR) synthesis algorithm. The advantage of such algorithm is that it can decode error words beyond the decoding radius. However, it also suffers from a large decoding delay as the interleaved degree increases. In this thesis, we try to improve the LSR synthesis algorithm in such a way that the corresponding decoding algorithm for interleaved Gabidulin codes incurs no extra decoding delay and can be executed in real time. We then devise a simple network model for testing the performance of our decoding algorithm versus the traditional one. Simulation shows that our algorithm only comes with a little performance loss.