• Publications
  • Influence
Improved decoding of Reed-Solomon and algebraic-geometry codes
TLDR
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.
Clustering with qualitative information
Improved decoding of Reed-Solomon and algebraic-geometric codes
  • V. Guruswami, M. Sudan
  • Computer Science, Mathematics
    Proceedings 39th Annual Symposium on Foundations…
  • 8 November 1998
TLDR
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometric codes is presented, including a solution to a weighted curve fitting problem, which is of use in soft-decision decoding algorithms for Reed- Solomon codes.
On profit-maximizing envy-free pricing
TLDR
It is shown that computing envy-free prices to maximize the seller's revenue is APX-hard in both of these cases, and the corresponding mechanism design problem, in which the consumer's preferences are private values, is investigated and given a log-competitive truthful mechanism.
Multiclass learning, boosting, and error-correcting codes
TLDR
ECC, that, by using a different weighting of the votes of the weak hypotheses, is able to improve on the performance of ADABOOST.OC, is arguably a more direct reduction of multiclass learning to binary learning problems than previous multiclass boosting algorithms.
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
TLDR
The method, which is referred to as CopyCatch, detects lockstep Page Like patterns on Facebook by analyzing only the social graph between users and Pages and the times at which the edges in the graph were created.
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
  • V. Guruswami, A. Rudra
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 18 November 2005
TLDR
This paper presents an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction of worst-case errors, and their methods directly yield better decoding algorithms for RS codes when errors occur in phased bursts.
Correlation clustering with a fixed number of clusters
TLDR
This paper focuses on the situation when the number of clusters is stipulated to be a small constant k, and finds that for every k, there is a polynomial time approximation scheme for both maximizing agreements and minimizing disagreements.
Repairing Reed-Solomon Codes
TLDR
The main result is that, in some parameter regimes, Reed–Solomon codes are optimal regenerating codes, among maximum distance separable (MDS) codes withlinear repair schemes with linear repair schemes.
...
1
2
3
4
5
...