Loading [a11y]/accessibility-menu.js
An Efficient Decoding Algorithm of Matrix Partition Codes | IEEE Journals & Magazine | IEEE Xplore

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...Show More

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|) + n2sm)). 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|n|D|msn)).
Published in: IEEE Signal Processing Letters ( Volume: 21, Issue: 4, April 2014)
Page(s): 414 - 417
Date of Publication: 29 January 2014

ISSN Information:

Funding Agency:


References

References is not available for this document.