An Efficient Decoding Algorithm of Matrix Partition Codes

Abstract

Recently, a multiple Slepian-Wolf Coding method called Matrix Partition Codes has been introduced. However, no explicit decoding algorithm has been established so far. In this letter, we propose a two-step decoding algorithm which just needs an extra one-time preprocessing (O(rsn|D|+ r|D|log(|D|) + n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> sm)). To illustrate the efficiency of our algorithm, we analyze the time complexity of our algorithm, and the results show that the complexity of our method (O(r log(|D|) + msn)) is exponentially better than the brute-force search method (O(|F| <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> |D|msn)).