Alexander Barg

According to our database1, Alexander Barg authored at least 191 papers between 1991 and 2019.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2008, "For contributions to coding theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters.
IEEE Trans. Information Theory, 2019

The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.
IEEE Trans. Information Theory, 2019

Codes With Hierarchical Locality From Covering Maps of Curves.
IEEE Trans. Information Theory, 2019

Capacity of dynamical storage systems.
CoRR, 2019

Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model.
CoRR, 2019

Capacity of dynamical storage systems.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Explicit constructions of MSR codes for the rack-aware storage model.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy.
IEEE Trans. Information Theory, 2018

Construction of Polar Codes for Arbitrary Discrete Memoryless Channels.
IEEE Trans. Information Theory, 2018

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes.
IEEE Trans. Information Theory, 2018

Exploiting Locality for Improved Decoding of Binary Cyclic Codes.
IEEE Trans. Communications, 2018

Optimal locally private estimation under 𝓁p loss for 1≤ p≤ 2.
CoRR, 2018

Codes with hierarchical locality from covering maps of curves.
CoRR, 2018

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.
CoRR, 2018

Optimal LRC codes for all lenghts n≤q.
CoRR, 2018

Optimal MDS codes for cooperative repair.
CoRR, 2018

On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

Codes on Curves with Hierarchical Locality.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Optimal Regenerating Codes for Cooperative Repair.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Clay Codes: Moulding MDS Codes to Yield an MSR Code.
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization.
IEEE Trans. Information Theory, 2017

Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth.
IEEE Trans. Information Theory, 2017

Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component.
IEEE Trans. Information Theory, 2017

Locally Recoverable Codes on Algebraic Curves.
IEEE Trans. Information Theory, 2017

Group Testing Schemes From Codes and Designs.
IEEE Trans. Information Theory, 2017

Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures.
CoRR, 2017

Asymptotically optimal private estimation under mean square loss.
CoRR, 2017

Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacy.
CoRR, 2017

Optimal repair of Reed-Solomon codes: Achieving the cut-set bound.
CoRR, 2017

Fractional decoding: Error correction from partial information.
CoRR, 2017

A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes.
CoRR, 2017

Locally recoverable codes from algebraic curves and surfaces.
CoRR, 2017

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes.
CoRR, 2017

Optimal schemes for discrete distribution estimation under local differential privacy.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Fractional decoding: Error correction from partial information.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A study on the impact of locality in the decoding of binary cyclic codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Bounds on the Parameters of Locally Recoverable Codes.
IEEE Trans. Information Theory, 2016

Interactive function computation via polar coding.
Probl. Inf. Transm., 2016

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes.
IJICoT, 2016

Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization.
CoRR, 2016

Explicit constructions of high-rate MDS array codes with optimal repair bandwidth.
CoRR, 2016

Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes.
CoRR, 2016

Construction of polar codes for arbitrary discrete memoryless channels.
CoRR, 2016

Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Group testing schemes from low-weight codewords of BCH codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Combinatorial and LP bounds for LRC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Construction of polar codes for arbitrary discrete memoryless channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Restricted Isometry Property of Random Subdictionaries.
IEEE Trans. Information Theory, 2015

Cyclic LRC Codes and their Subfield Subcodes.
CoRR, 2015

Bounds on the Parameters of Locally Recoverable Codes.
CoRR, 2015

Locally recoverable codes on algebraic curves.
CoRR, 2015

Restricted isometry property of random subdictionaries.
CoRR, 2015

Almost disjunct matrices from codes and designs.
CoRR, 2015

Polar codes for distributed hierarchical source coding.
Adv. in Math. of Comm., 2015

Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Polar codes using dynamic kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Cyclic LRC codes and their subfield subcodes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Locally recoverable codes on algebraic curves.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A Family of Optimal Locally Recoverable Codes.
IEEE Trans. Information Theory, 2014

Linear codes on posets with extension property.
Discrete Mathematics, 2014

Universal Source Polarization and an Application to a Multi-User Problem.
CoRR, 2014

Polar Codes for Distributed Hierarchical Source Coding.
CoRR, 2014

Bounds on Locally Recoverable Codes with Multiple Recovering Sets.
CoRR, 2014

Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel with a Confidential Component.
CoRR, 2014

Interactive Function Computation via Polar Coding.
CoRR, 2014

Bounds on locally recoverable codes with multiple recovering sets.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

A family of optimal locally recoverable codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Universal source polarization and an application to a multi-user problem.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Interactive function computation via polar coding.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Polar Codes for $q$-Ary Channels, $q=2^{r}$.
IEEE Trans. Information Theory, 2013

Constructions of Rank Modulation Codes.
IEEE Trans. Information Theory, 2013

Robust Parent-Identifying Codes and Combinatorial Arrays.
IEEE Trans. Information Theory, 2013

New Bounds for Spherical Two-Distance Sets.
Experimental Mathematics, 2013

Linear codes on posets with extension property
CoRR, 2013

Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery
CoRR, 2013

A family of optimal locally recoverable codes.
CoRR, 2013

Association schemes on general measure spaces and zero-dimensional Abelian groups.
CoRR, 2013

Controlled polarization for q-ary alphabets.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Polar codes for q-ary channels, q=2r.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Translation association schemes, poset metrics, and the shape enumerator of codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Coding for High-Density Recording on a 1-D Granular Magnetic Medium.
IEEE Trans. Information Theory, 2011

On the Number of Errors Correctable with Codes on Graphs.
IEEE Trans. Information Theory, 2011

Bounds on sets with few distances.
J. Comb. Theory, Ser. A, 2011

Robust parent-identifying codes and combinatorial arrays.
IACR Cryptology ePrint Archive, 2011

Constructions of Rank Modulation Codes
CoRR, 2011

Multilevel polarization for nonbinary codes and parallel channels
CoRR, 2011

The ordered Hamming metric and ordered symmetric channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Constructions of rank modulation codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Channels with intermittent errors.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

General constructions of deterministic (S)RIP matrices for compressive sampling.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

List decoding of product codes by the MinSum algorithm.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Multilevel polarization for nonbinary codes and parallel channels.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Parameters of rank modulation codes: Examples.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Sparse recovery properties of statistical RIP matrices.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Secret Key Generation for a Pairwise Independent Network Model.
IEEE Trans. Information Theory, 2010

Codes in permutations and error correction for rank modulation.
IEEE Trans. Information Theory, 2010

Coding for High-Density Recording on a 1-D Granular Magnetic Medium
CoRR, 2010

Secret Key Generation for a Pairwise Independent Network Model
CoRR, 2010

Near MDS poset codes and distributions.
CoRR, 2010

Robust parent-identifying codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Coding for high-density magnetic recording.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Near MDS poset codes and distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Small ensembles of sampling matrices constructed from coding theory.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Bounds on codes with few distances.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Codes in permutations and error correction for rank modulation.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Two-level fingerprinting: Stronger definitions and code constructions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
On the Number of Errors Correctable with Codes on Graphs
CoRR, 2009

Codes in Permutations and Error Correction for Rank Modulation
CoRR, 2009

Bounds on sets with few distances
CoRR, 2009

Two-Level Fingerprinting Codes
CoRR, 2009

Perfect secrecy, perfect omniscience and steiner tree packing.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the number of errors correctable with codes on graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Two-level fingerprinting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes.
IEEE Trans. Information Theory, 2008

On the Fingerprinting Capacity Under the Marking Assumption.
IEEE Trans. Information Theory, 2008

A functional view of upper bounds on codes
CoRR, 2008

Codes on hypergraphs
CoRR, 2008

Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing
CoRR, 2008

Weight distribution and decoding of codes on hypergraphs.
Adv. in Math. of Comm., 2008

Secret key generation for a pairwise independent network model.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Codes on hypergraphs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Bounds on ordered codes and orthogonal arrays
CoRR, 2007

Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes
CoRR, 2007

Codes in spherical caps.
Adv. in Math. of Comm., 2007

Error Bounds for Algebraic Soft-Decision Decoding of Reed-Solomon Codes over Additive-Noise Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on ordered codes and orthogonal arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Fingerprinting Capacity Under the Marking Assumption.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Distance properties of expander codes.
IEEE Trans. Information Theory, 2006

Spectral approach to linear programming bounds on codes.
Probl. Inf. Transm., 2006

A bound on Grassmannian codes.
J. Comb. Theory, Ser. A, 2006

Codes in spherical caps
CoRR, 2006

On the Fingerprinting Capacity Under the Marking Assumption
CoRR, 2006

A bound on Grassmannian codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Random Binary Fingerprinting Codes for Arbitrarily Sized Coalitions.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Fingerprinting.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Concatenated codes: serial and parallel.
IEEE Trans. Information Theory, 2005

Correction to "Bounds on Packings of Spheres in the Grassmann Manifold".
IEEE Trans. Information Theory, 2005

Distance distribution of binary codes and the error probability of decoding.
IEEE Trans. Information Theory, 2005

Spectral approach to linear programming bounds on codes
CoRR, 2005

A bound on Grassmannian codes
CoRR, 2005

Multilevel expander codes
CoRR, 2005

2004
Improved error bounds for the erasure/list scheme: the binary and spherical cases.
IEEE Trans. Information Theory, 2004

Error Exponents of Expander Codes under Linear-Complexity Decoding.
SIAM J. Discrete Math., 2004

A class of I.P.P. codes with efficient identification.
J. Complexity, 2004

Distance properties of expander codes
CoRR, 2004

Distance distribution of binary codes and the error probability of decoding
CoRR, 2004

Improved error bounds for the erasure/list scheme: the binary and spherical cases
CoRR, 2004

On the asymptotic accuracy of the union bound
CoRR, 2004

Distance properties of expander codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

List decoding of concatenated codes: improved performance estimates.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Digital fingerprinting codes: problem statements, constructions, identification of traitors.
IEEE Trans. Information Theory, 2003

Multilevel expander codes.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Error exponents of expander codes.
IEEE Trans. Information Theory, 2002

Bounds on packings of spheres in the Grassmann manifold.
IEEE Trans. Information Theory, 2002

Random codes: Minimum distances and error exponents.
IEEE Trans. Information Theory, 2002

A low-rate bound on the reliability of a quantum discrete memoryless channel.
IEEE Trans. Information Theory, 2002

On Some Polynomials Related to Weight Enumerators of Linear Codes.
SIAM J. Discrete Math., 2002

Bounds on the Covering Radius of Linear Codes.
Des. Codes Cryptogr., 2002

2001
Concatenated codes with fixed inner code and random outer code.
IEEE Trans. Information Theory, 2001

Estimates of the distance distribution of codes and designs.
IEEE Trans. Information Theory, 2001

A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents.
SIAM J. Discrete Math., 2001

Linear Codes with Exponentially Many Light Vectors.
J. Comb. Theory, Ser. A, 2001

A hypergraph approach to the identifying parent property: the case of multiple parents.
Electronic Notes in Discrete Mathematics, 2001

Estimates of the Distance Distribution of Codes and Designs.
Electronic Notes in Discrete Mathematics, 2001

2000
A new upper bound on the reliability function of the Gaussian channel.
IEEE Trans. Information Theory, 2000

Quantum error detection II: Bounds.
IEEE Trans. Information Theory, 2000

Quantum error detection I: Statement of the problem.
IEEE Trans. Information Theory, 2000

1999
Linear-time binary codes correcting localized erasures.
IEEE Trans. Information Theory, 1999

On the complexity of minimum distance decoding of long linear codes.
IEEE Trans. Information Theory, 1999

New Upper Bounds on Generalized Weights.
IEEE Trans. Information Theory, 1999

Binomial Moments of the Distance Distribution: Bounds and Applications.
IEEE Trans. Information Theory, 1999

Binomial Moments of the Distance Distribution and the Probability of Undetected Error.
Des. Codes Cryptogr., 1999

Polynomial method in coding and information theory
CoRR, 1999

Numerical results on the asymptotic rate of binary codes.
Proceedings of the Codes and Association Schemes, 1999

Estimates of the distance distribution of nonbinary codes, with applications.
Proceedings of the Codes and Association Schemes, 1999

1998
Minimal Vectors in Linear Codes.
IEEE Trans. Information Theory, 1998

1997
Complexity Issues in Coding Theory
Electronic Colloquium on Computational Complexity (ECCC), 1997

A large family of sequences with low periodic correlation.
Discrete Mathematics, 1997

The Matroid of Supports of A Linear Code.
Appl. Algebra Eng. Commun. Comput., 1997

Minimum Distance Decoding Algorithms for Linear Codes.
Proceedings of the Applied Algebra, 1997

1996
Two families of low-correlated binary sequences.
Appl. Algebra Eng. Commun. Comput., 1996

1995
A Broadcast Key Distribution Scheme Based on Block Designs.
Proceedings of the Cryptography and Coding, 1995

Minimal Supports in Linear Codes.
Proceedings of the Cryptography and Coding, 1995

Variations on Minimal Codewords in Linear Codes.
Proceedings of the Applied Algebra, 1995

1993
Incomplete Sums, DC-Constrained Codes, and Codes that Maintain Synchronization.
Des. Codes Cryptogr., 1993

1992
On computing the weight spectrum of cyclic codes.
IEEE Trans. Information Theory, 1992

1991
DC-constrained codes from Hadamard matrices.
IEEE Trans. Information Theory, 1991

Exponential Sums and Constrained Error-Correcting Codes.
Proceedings of the Algebraic Coding, 1991


  Loading...