Abstract | ||
---|---|---|
We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this problem, which takes the form of a linear program, by utilizing random binning and simultaneous decoding techniques [1] and compare it with the existing bounds. We... |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/TIT.2019.2922625 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Decoding,Rate-distortion,Distortion,Upper bound,Encoding,Indexes,Random variables | Discrete mathematics,Rate distortion,Mathematical optimization,Upper and lower bounds,Algorithm,Side information,Coding (social sciences),Gaussian,Linear programming,Decoding methods,Mathematics | Journal |
Volume | Issue | ISSN |
65 | 11 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sinem Unal | 1 | 14 | 2.54 |
Aaron B. Wagner | 2 | 322 | 37.39 |