• Citations Per Year
Learn More
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into sub-matrices which are filled with a proposed trimming step and then are recombined to form a low-rank completed matrix. The divide-and-conquer approach can significantly reduce computation complexity and storage requirement.(More)
We consider zero-error Slepian-Wolf coding for a special kind of correlated sources known as Hamming sources. Moreover, we focus on the design of codes with minimum redundancy (i.e., perfect codes). As shown in a prior work by Koulgi et al., the design of a perfect code for a general source is very difficult and in fact is NP-hard. In our recent work, we(More)
We introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect Slepian-Wolf (SW) coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for perfect SW(More)
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of a set of sources with deviation symmetry, where the sources are generalization of the Hamming sources over an arbitrary field. We extend our previous codes, Generalized Hamming Codes for Multiple Sources, to Matrix Partition Codes and use the latter to efficiently compress the(More)
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of a set of sources with deviation symmetry, where the sources are generalization of the Hamming sources over an arbitrary field. We extend our previous codes, generalized Hamming codes for multiple sources, to matrix partition codes and use the latter to efficiently compress the(More)
We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. We then introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect SW coding for arbitrary number of terminals. Moreover, we study the case(More)
  • 1