• Publications
  • Influence
Codes in Permutations and Error Correction for Rank Modulation
  • A. Barg, A. Mazumdar
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 27 August 2009
TLDR
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. Expand
  • 166
  • 20
  • PDF
Bounds on the Size of Locally Recoverable Codes
  • V. Cadambe, A. Mazumdar
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 9 September 2015
TLDR
In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. Expand
  • 105
  • 18
  • PDF
An upper bound on the size of locally recoverable codes
  • V. Cadambe, A. Mazumdar
  • Computer Science, Mathematics
  • International Symposium on Network Coding (NetCod…
  • 7 June 2013
TLDR
In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. Expand
  • 80
  • 15
  • PDF
Cooperative local repair in distributed storage
TLDR
This paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. Expand
  • 65
  • 7
  • PDF
Clustering with Noisy Queries
TLDR
In this paper, we initiate a rigorous theoretical study of clustering with noisy queries (or a faulty oracle). Expand
  • 43
  • 7
  • PDF
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
TLDR
Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. Expand
  • 25
  • 7
  • PDF
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes
TLDR
We establish that the number of encoded bits that should change in response to a change in a single information bit must scale logarithmically in the block-length of the code, if we are to achieve any nontrivial rate with vanishing probability of error over the binary erasure or binary symmetric channels. Expand
  • 28
  • 4
  • PDF
Nonadaptive Group Testing With Random Set of Defectives
  • A. Mazumdar
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 11 March 2015
TLDR
In a group testing scheme, a series of tests are designed to identify a small number t of defective items that are present among a large number N of items. Expand
  • 32
  • 3
  • PDF
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
TLDR
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. Expand
  • 32
  • 3
  • PDF
vqSGD: Vector Quantized Stochastic Gradient Descent
TLDR
We present a family of vector quantization schemes \emph{vqSGD} (Vector-Quantized Stochastic Gradient Descent) that provide an asymptotic reduction in the communication cost with convergence guarantees in first order distributed optimization. Expand
  • 22
  • 3
  • PDF
...
1
2
3
4
5
...