187 citations
- Carnegie Mellon UniversityUS2 papers
- Microsoft (United States)US2 papers
- Baidu (China)CN1 paper
- Bar-Ilan UniversityIL1 paper
- Ben-Gurion University of the NegevIL1 paper
- Concern Worldwide UKGB1 paper
- Concern Worldwide USUS1 paper
- Cornell UniversityUS1 paper
- ETH ZurichCH1 paper
- FORTH Institute of Computer ScienceGR1 paper
- Georgia Institute of TechnologyUS1 paper
- Hewlett Packard Enterprise (United States)US1 paper
4 papers · 1 filter
Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, Swastik Kopparty +3
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in…
When Queueing Meets Coding: Optimal-Latency Data Retrieving Scheme in Storage Clouds
Shengbo Chen, Yin Sun, Ulas C. Kozat +5
In this paper, we study the problem of reducing the delay of downloading data from cloud storage systems by leveraging multiple parallel threads, assuming that the data has been en…
Multi-User MIMO with outdated CSI: Training, Feedback and Scheduling
Ansuman Adhikary, Haralabos C. Papadopoulos, Sean A. Ramprashad +1
Conventional MU-MIMO techniques, e.g. Linear Zero-Forced Beamforming (LZFB), require sufficiently accurate channel state information at the transmitter (CSIT) in order to realize s…
Alphabetic Coding with Exponential Costs
Michael B. Baer
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of op…