n-channel symmetric multiple descriptions-part I:(n, k) source-channel erasure codes
IEEE Transactions on Information Theory, 2004 - ieeexplore.ieee.org
In this two-part paper, we present a new achievable rate region for the general n-channel
symmetric multiple descriptions problem. In part I, inspired by the concept of maximum …
symmetric multiple descriptions problem. In part I, inspired by the concept of maximum …
[引用][C] n-Channel Symmetric Multiple Descriptions-PartI:(n, k) Source-Channel Erasure Codes
SS PRADHAN - IEEE Trans. on Information Theory, 2004 - cir.nii.ac.jp
n-channel symmetric multiple descriptions-part I: (n, k) source-channel erasure codes
SS Pradhan, R Puri, K Ramchandran - IEEE Transactions on Information …, 2006 - dl.acm.org
In this two-part paper, we present a new achievable rate region for the general n-channel
symmetric multiple descriptions problem. In part I, inspired by the concept of maximum …
symmetric multiple descriptions problem. In part I, inspired by the concept of maximum …