What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
Discrete mathematics, Combinatorics, List decoding, Linear code and Concatenated error correction code are his primary areas of study.
His studies deal with areas such as Decoding methods and Bounded function as well as Discrete mathematics.
His Decoding methods study incorporates themes from Binary code, Channel capacity, Coding theory and Redundancy.
His work deals with themes such as Computational complexity theory and Reed–Solomon error correction, which intersect with Combinatorics.
His research integrates issues of Sequential decoding, Hamming code, Bipartite graph and Expander graph in his study of List decoding.
He focuses mostly in the field of Linear code, narrowing it down to topics relating to Hamming distance and, in certain cases, Restricted isometry property, Order and Isometry.
His most cited work include:
- Improved decoding of Reed-Solomon and algebraic-geometry codes (930 citations)
- Improved decoding of Reed-Solomon and algebraic-geometric codes (265 citations)
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (254 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Combinatorics, Discrete mathematics, List decoding, Linear code and Decoding methods.
Combinatorics is frequently linked to Upper and lower bounds in his study.
The concepts of his Discrete mathematics study are interwoven with issues in Fraction, Bounded function, Polynomial and Degree.
His List decoding research integrates issues from Sequential decoding, Hamming code and Reed–Solomon error correction.
Block code covers Venkatesan Guruswami research in Linear code.
He has researched Decoding methods in several fields, including Redundancy, Coding theory and Channel capacity.
He most often published in these fields:
- Combinatorics (60.66%)
- Discrete mathematics (57.58%)
- List decoding (25.41%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (60.66%)
- Discrete mathematics (57.58%)
- Upper and lower bounds (14.75%)
In recent papers he was focusing on the following fields of study:
Venkatesan Guruswami spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Omega and Bounded function.
As a part of the same scientific study, he usually deals with the Combinatorics, concentrating on Linear code and frequently concerns with Hamming code.
His Discrete mathematics study integrates concerns from other disciplines, such as List decoding, Polynomial and Binary number.
His List decoding research incorporates elements of Subspace topology, Integer, Algebraic number and Degree.
Venkatesan Guruswami works mostly in the field of Polynomial, limiting it down to concerns involving Function and, occasionally, Algorithm.
His Upper and lower bounds research includes elements of Code word, Code, Coding theory, Complement and Erasure code.
Between 2016 and 2021, his most popular works were:
- Repairing Reed-Solomon Codes (68 citations)
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions (67 citations)
- Deletion Codes in the High-Noise and High-Rate Regimes (41 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
Venkatesan Guruswami mainly focuses on Discrete mathematics, Combinatorics, Upper and lower bounds, Code and Code word.
He combines subjects such as Martingale, Polynomial and Bounded function with his study of Discrete mathematics.
His research on Combinatorics frequently connects to adjacent areas such as Metric.
The Upper and lower bounds study combines topics in areas such as PSPACE, Binary code, Binary number, Complement and Erasure code.
List decoding is closely connected to Concatenation in his research, which is encompassed under the umbrella topic of Code rate.
In his research, Concatenated error correction code is intimately related to Linear code, which falls under the overarching field of Elliptic curve.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
