885 citations · 2.1k across the 60 of their papers we have counts for
14 papers · 1 filter
Binary Deletion Channel Capacity to Within One Hundredth of a Bit
Dimitris Papailiopoulos
The exact capacity of the binary deletion channel remains unknown despite decades of work on achievable rates and converse bounds. We establish a computer-assisted approximation wh…
Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold
Dimitris Papailiopoulos
We prove that exact block recovery in the square Gaussian binary MIMO model can be achieved in polynomial time at the same first-order SNR threshold as exhaustive maximum-likelihoo…
Locality and Availability in Distributed Storage
Ankit Singh Rawat, Dimitris S. Papailiopoulos, Alexandros G. Dimakis +1
This paper studies the problem of code symbol availability: a code symbol is said to have -availability if it can be reconstructed from disjoint groups of other symbols…
The Sparse Principal Component of a Constant-rank Matrix
Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos
The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optim…
A Repair Framework for Scalar MDS Codes
Karthikeyan Shanmugam, Dimitris S. Papailiopoulos, Alexandros G. Dimakis +1
Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol afte…
XORing Elephants: Novel Erasure Codes for Big Data
Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos +4
Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of thre…