@conference {Vellambi2016,
title = {Lossy Compression with Near-uniform Encoder Outputs},
booktitle = {Proc. of IEEE International Symposium on Information Theory},
year = {2016},
month = {July},
pages = {530-534},
abstract = {It is well known that lossless compression of a discrete memoryless source with near-uniform encoder output is possible at a rate above its entropy if and only if the encoder and decoder share a common random seed. This work focuses on deriving conditions for near-uniform encoder output(s) in the Wyner-Ziv and the distributed lossy compression problems. We show that in the Wyner-Ziv problem, near-uniform encoder output and operation close to the WZ-rate limit is simultaneously possible, whereas in the distributed lossy compression problem, jointly near-uniform outputs is achievable in the interior of the distributed lossy compression rate region if the sources share non-trivial G{\'a}cs-K{\"o}rner common information.},
keywords = {Decoding, Distortion, Electronic mail, Encoding, Monte Carlo methods, Receivers},
doi = {10.1109/ISIT.2016.7541355},
author = {Badri N. Vellambi and J{\"o}rg Kliewer and Matthieu R Bloch}
}
@booklet {Vellambi2016a,
title = {Strong Coordination over Multi-hop Line Networks},
year = {2016},
month = {April},
author = {Badri N. Vellambi and Joerg Kliewer and Matthieu R Bloch}
}
@proceedings {Vellambi2015,
title = {Lossless and Lossy Source Compression with Near-Uniform Outputs: Is Common Randomness Always Required?},
journal = {Proc. IEEE International Symposium on Information Theory},
year = {2015},
month = {June},
pages = {2171-2175},
publisher = {IEEE},
address = {Honk Kong},
abstract = {It is known that a sub-linear rate of source-independent random seed (common randomness) can enable the construction of lossless compression codes whose output is nearly uniform under the variational distance (Chou-Bloch-ISIT{\textquoteright}13). This work uses finite-blocklength techniques to present an alternate proof that for near-uniform lossless compression the seed length has to grow strictly larger than sqrt(n), where n represents the blocklength of the lossless compression code. In the lossy setting, we show the surprising result that a seed is not required to make the encoder output nearly uniform.},
doi = {10.1109/ISIT.2015.7282840},
author = {Badri N. Vellambi and Matthieu R Bloch and R{\'e}mi A Chou and J{\"o}rg Kliewer}
}
@proceedings {Vellambi2015a,
title = {Strong Coordination over Multi-hop Line Networks},
journal = {IEEE Information Theory Workshop},
year = {2015},
month = {October},
pages = {192--196},
publisher = {IEEE},
address = {Jeju, South Korea},
abstract = {We analyze the problem of strong coordination over a multi-hop line network where the node initiating the coordination is a terminal network node. We provide a character- ization of the capacity region when the initiating node possesses unlimited local randomness and intermediate nodes operate under a functional regime. In this regime, next-hop messages are created only using common randomness and previous-hop incoming messages, i.e., local randomness at intermediate nodes is only used for generating actions.},
doi = {10.1109/ITWF.2015.7360761},
author = {Badri N. Vellambi and J{\"o}rg Kliewer and Matthieu R Bloch}
}