World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
7954
World Ranking
7227
National Ranking
3155

Mathematics

D-Index
45
Citations
7869
World Ranking
1477
National Ranking
647

Research.com Recognitions

  • 2008 - IEEE Fellow For contributions to coding theory

Overview

Alexander Barg is affiliated with the University of Maryland, College Park in the United States. Their research interests primarily focus on computer science, with significant contributions in areas such as computer networks and communications, artificial intelligence, computational theory and mathematics, electrical and electronic engineering, and molecular biology.

The scientist's main research topics encompass:

  • Advanced Data Storage Technologies
  • Coding theory and cryptography
  • Caching and Content Delivery
  • Cooperative Communication and Network Coding
  • DNA and Biological Computing
  • Cellular Automata and Applications
  • Wireless Communication Security Techniques

Alexander Barg has authored numerous papers published in various academic venues. Some recent publications include:

  • "Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes," 2020, IEEE Transactions on Information Theory
  • "High-Rate Storage Codes on Triangle-Free Graphs," 2022, IEEE Transactions on Information Theory
  • "On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes," 2020, ACM Transactions on Storage
  • "Cyclic and Convolutional Codes With Locality," 2020, IEEE Transactions on Information Theory
  • "Quantum spherical codes," 2024, Nature Physics

Frequent co-authors in their research include the following collaborators:

  • Adway Patra
  • Zitan Chen
  • Madhura Pathegama
  • Ohad Elishco
  • Ryan Gabrys

The primary venues where Alexander Barg has published their work include:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • Designs Codes and Cryptography
  • 2022 IEEE International Symposium on Information Theory (ISIT)
  • Nature Physics

Alexander Barg was recognized as an IEEE Fellow in 2008 for contributions to coding theory.

Best Publications

  • A family of optimal locally recoverable codes

    Itzhak Tamo;Alexander Barg

  • Minimal vectors in linear codes

    A. Ashikhmin;A. Barg

  • Random codes: minimum distances and error exponents

    A. Barg;G.D. Forney

  • Digital fingerprinting codes: problem statements, constructions, identification of traitors

    A. Barg;G.R. Blakley;G.A. Kabatiansky

  • Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth

    Min Ye;Alexander Barg

  • Bounds on packings of spheres in the Grassmann manifold

    A. Barg;D.Yu. Nogin

  • Codes in Permutations and Error Correction for Rank Modulation

    Alexander Barg;Arya Mazumdar

  • Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization

    Min Ye;Alexander Barg

  • Complexity Issues in Coding Theory

    Alexander Barg

  • Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy

    Min Ye;Alexander Barg

  • Error exponents of expander codes

    A. Barg;G. Zemor

  • Polar Codes for Q-Ary Channels, $q=2^{r}$

    W. Park;A. Barg

  • Bounds on the Parameters of Locally Recoverable Codes

    Itzhak Tamo;Alexander Barg;Alexey Frolov

  • A hypergraph approach to the identifying parent property: the case of multiple parents

    Alexander Barg;Gérard D. Cohen;Sylvia B. Encheva;Grigory Kabatiansky

  • Locally Recoverable Codes on Algebraic Curves

    Alexander Barg;Itzhak Tamo;Serge Vladut

  • Secret Key Generation for a Pairwise Independent Network Model

    S Nitinawarat;Chunxuan Ye;A Barg;P Narayan

  • Bounds on locally recoverable codes with multiple recovering sets

    Itzhak Tamo;Alexander Barg

  • Concatenated codes: serial and parallel

    A. Barg;G. Zemor

  • Distance properties of expander codes

    A. Barg;G. Zemor

  • Problems of Information Transmission

    L. A. Bassalygo;N. A. Kuznetsov;D. Yu;A. M. Barg

  • Optimal schemes for discrete distribution estimation under local differential privacy

    Min Ye;Alexander Barg

  • Multilevel expander codes

    A. Barg;G. Zemor

Frequent Co-Authors

Gilles Zémor
Gilles Zémor University of Bordeaux
Alexei Ashikhmin
Alexei Ashikhmin Nokia (United States)
Simon Litsyn
Simon Litsyn Tel Aviv University
Alexander Reznik
Alexander Reznik Hewlett Packard Enterprise (United States)
Emanuel Knill
Emanuel Knill National Institute of Standards and Technology
P. Vijay Kumar
P. Vijay Kumar Indian Institute of Science
Andrew McGregor
Andrew McGregor University of Massachusetts Amherst

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens up diverse career paths, many of which intersect with growing fields like data analytics and business administration. For those interested in advancing their analytical skills, pursuing one of the best masters in data analytics programs offers specialized training to harness complex data for strategic decision-making.

Alternatively, professionals aiming to complement their quantitative expertise with strong business acumen might explore an easiest mba to get into or an easy online mba. These flexible programs provide essential leadership and management skills, often designed for working adults balancing career and education.

For those targeting higher executive roles, pursuing one of the cheapest online dba programs can be a practical, cost-effective way to attain a doctoral degree focused on business administration and strategic leadership.

Overall, combining a mathematics foundation with targeted online degrees can greatly enhance career prospects and adaptability in today’s competitive job market.

Best Scientists Citing Alexander Barg

Trending Scientists