Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem with Markovity | 0 | 0.34 | 2022 |
On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels | 0 | 0.34 | 2021 |
Principal Bit Analysis: Autoencoding With Schur-Concave Loss | 0 | 0.34 | 2021 |
Optimal Mechanisms Under Maximal Leakage | 0 | 0.34 | 2020 |
Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound | 0 | 0.34 | 2020 |
A New Method for Employing Feedback to Improve Coding Performance | 0 | 0.34 | 2020 |
Functional Covering Of Point Processes | 0 | 0.34 | 2019 |
A New Proof For The Quadratic Gaussian Two-Encoder Source-Coding Problem | 0 | 0.34 | 2019 |
Measuring Quantum Entropy | 0 | 0.34 | 2019 |
The Quadratic Gaussian One-Help-Two Source-Coding Problem With Markovity | 0 | 0.34 | 2018 |
Variable Packet-Error Coding: The Point-To-Point Case | 0 | 0.34 | 2018 |
When Does Feedback Improve The Second-Order Coding Rate In Discrete Memoryless Channels? | 0 | 0.34 | 2018 |
Variable Packet-Error Coding. | 1 | 0.35 | 2018 |
An Operational Approach to Information Leakage | 6 | 0.47 | 2018 |
Gaussian variable packet-error coding. | 0 | 0.34 | 2017 |
Resilient communication against adversarial path-errors. | 0 | 0.34 | 2017 |
Coding for the Large-Alphabet Adversarial Channel. | 0 | 0.34 | 2017 |
An LP Upper Bound for Rate Distortion with Variable Side Information | 0 | 0.34 | 2017 |
The stochastic-calculus approach to multi-receiver poisson channels. | 0 | 0.34 | 2017 |
On very noisy channels with feedback. | 0 | 0.34 | 2017 |
LP Bounds for Rate-Distortion with Variable Side Information. | 0 | 0.34 | 2016 |
An operational measure of information leakage | 17 | 0.87 | 2016 |
A Downlink Scheduler for Multicasting Wireless Video-on-Demand | 1 | 0.35 | 2016 |
Vector Gaussian multi-decoder rate-distortion: Trace constraints | 1 | 0.37 | 2016 |
Measuring Secrecy by the Probability of a Successful Guess | 3 | 0.39 | 2015 |
Rate region of the vector Gaussian one-helper source-coding problem | 2 | 0.39 | 2015 |
Must one learn the channel to communicate at capacity? | 1 | 0.35 | 2014 |
Moderate Deviations in Channel Coding | 27 | 1.09 | 2014 |
Feedback can improve the second-order coding performance in discrete memoryless channels | 6 | 0.55 | 2014 |
The third-order term in the normal approximation for singular channels | 8 | 0.63 | 2014 |
A Rate–Distortion Approach to Index Coding | 7 | 0.54 | 2014 |
Vector Gaussian rate-distortion with variable side information | 2 | 0.41 | 2014 |
Refinement of the Sphere-Packing Bound: Asymmetric Channels | 1 | 0.34 | 2014 |
Classification of Homogeneous Data With Large Alphabets | 6 | 0.64 | 2013 |
Information Embedding and the Triple Role of Control. | 3 | 0.42 | 2013 |
Polytope codes for large-alphabet channels | 4 | 0.43 | 2013 |
General Index Coding With Side Information: Three Decoder Case | 4 | 0.55 | 2013 |
Multicasting for wireless video-on-demand | 0 | 0.34 | 2013 |
Achieving Capacity Of Large Alphabet Discrete Memoryless Channels | 3 | 0.48 | 2013 |
Lossless compression with moderate error probability | 4 | 0.40 | 2013 |
Source and channel simulation using arbitrary randomness | 0 | 0.34 | 2012 |
Sum Rate of the Vacationing-CEO Problem | 0 | 0.34 | 2012 |
Erasure Multiple Descriptions | 11 | 0.71 | 2012 |
Near-lossless compression of large alphabet sources | 3 | 0.48 | 2012 |
Refinement of the Random Coding Bound | 14 | 0.92 | 2012 |
Refinement of the sphere-packing bound | 6 | 0.55 | 2012 |
Lossy Source Coding With Byzantine Adversaries | 5 | 0.52 | 2011 |
Probability Estimation in the Rare-Events Regime | 13 | 0.99 | 2011 |
Reliability in Source Coding With Side Information | 8 | 0.47 | 2011 |
Distributed Rate-Distortion With Common Components | 20 | 0.92 | 2011 |