The following pages link to Badri N. Vellambi (Q3092875):
Displaying 10 items.
- Gain from the two-envelope problem via information asymmetry: on the suboptimality of randomized switching (Q3092877) (← links)
- Rateless Codes With Unequal Error Protection Property (Q3548100) (← links)
- Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel (Q3548897) (← links)
- Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks (Q4566690) (← links)
- Polynomial Phase Estimation by Least Squares Phase Unwrapping (Q4579128) (← links)
- Strong Coordination Over Noisy Channels (Q5001576) (← links)
- Common Reconstructions in the Successive Refinement Problem With Receiver Side Information (Q5211448) (← links)
- Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels (Q5211565) (← links)
- Throughput and Latency in Finite-Buffer Line Networks (Q5273617) (← links)
- Coding Schemes for Achieving Strong Secrecy at Negligible Cost (Q5280872) (← links)