☰

Alexander Barg - Publications

Affiliations: 
Electrical and Computer Engineering University of Maryland, College Park, College Park, MD 
Website:
https://ece.umd.edu/clark/faculty/359/Alexander-Barg
Tree Info Similar researchers PubMed Report error

101 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2023 Pathegama M, Barg A. Smoothing of Binary Codes, Uniform Distributions, and Applications. Entropy (Basel, Switzerland). 25. PMID 37998208 DOI: 10.3390/e25111515  0.501
2020 Kolosov O, Yadgar G, Liram M, Tamo I, Barg A. On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes Acm Transactions On Storage. 16: 1-32. DOI: 10.1145/3381832  0.36
2020 Chen Z, Ye M, Barg A. Enabling optimal access and error correction for the repair of Reed-Solomon codes Ieee Transactions On Information Theory. 1-1. DOI: 10.1109/Tit.2020.3017666  0.517
2020 Tamo I, Ye M, Barg A. Error Correction Based on Partial Information Ieee Transactions On Information Theory. 66: 1396-1404. DOI: 10.1109/Tit.2019.2954409  0.558
2020 Chen Z, Barg A. Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model Ieee Transactions On Information Theory. 66: 886-899. DOI: 10.1109/Tit.2019.2941744  0.567
2019 Ballentine S, Barg A, Vladut S. Codes With Hierarchical Locality From Covering Maps of Curves Ieee Transactions On Information Theory. 65: 6056-6071. DOI: 10.1109/Tit.2019.2919830  0.599
2019 Tamo I, Ye M, Barg A. The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size Ieee Transactions On Information Theory. 65: 2673-2695. DOI: 10.1109/Tit.2018.2884075  0.519
2019 Ye M, Barg A. Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters Ieee Transactions On Information Theory. 65: 1639-1656. DOI: 10.1109/Tit.2018.2856206  0.441
2018 Ye M, Barg A. Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy Ieee Transactions On Information Theory. 64: 5662-5676. DOI: 10.1109/Tit.2018.2809790  0.332
2018 Agarwal A, Barg A, Hu S, Mazumdar A, Tamo I. Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes Ieee Transactions On Information Theory. 64: 3481-3492. DOI: 10.1109/Tit.2018.2800042  0.741
2018 Gulcu TC, Ye M, Barg A. Construction of Polar Codes for Arbitrary Discrete Memoryless Channels Ieee Transactions On Information Theory. 64: 309-321. DOI: 10.1109/Tit.2017.2765663  0.58
2018 Krishnan MN, Puranik B, Kumar PV, Tamo I, Barg A. Exploiting Locality for Improved Decoding of Binary Cyclic Codes Ieee Transactions On Communications. 66: 2346-2358. DOI: 10.1109/Tcomm.2018.2797988  0.576
2017 Barg A, Mazumdar A. Group Testing Schemes From Codes and Designs Ieee Transactions On Information Theory. 63: 7131-7141. DOI: 10.1109/Tit.2017.2746564  0.646
2017 Ye M, Barg A. Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization Ieee Transactions On Information Theory. 63: 6307-6317. DOI: 10.1109/Tit.2017.2730863  0.496
2017 Barg A, Tamo I, Vladut S. Locally Recoverable Codes on Algebraic Curves Ieee Transactions On Information Theory. 63: 4928-4939. DOI: 10.1109/Tit.2017.2700859  0.645
2017 Ye M, Barg A. Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth Ieee Transactions On Information Theory. 63: 2001-2014. DOI: 10.1109/Tit.2017.2661313  0.508
2016 Tamo I, Barg A, Goparaju S, Calderbank R. Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes International Journal of Information and Coding Theory. 3: 345-364. DOI: 10.1504/Ijicot.2016.079496  0.645
2016 Tamo I, Barg A, Frolov A. Bounds on the Parameters of Locally Recoverable Codes Ieee Transactions On Information Theory. 62: 3070-3083. DOI: 10.1109/Tit.2016.2518663  0.651
2015 Ye M, Barg A. Polar codes for distributed hierarchical source coding Advances in Mathematics of Communications. 9: 87-103. DOI: 10.3934/Amc.2015.9.87  0.567
2015 Barg A, Park W. On linear ordered codes Moscow Mathematical Journal. 15: 679-702. DOI: 10.17323/1609-4514-2015-15-4-679-702  0.723
2015 Gulcu TC, Barg A. Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component 2015 Ieee Information Theory Workshop, Itw 2015. DOI: 10.1109/Tit.2016.2631223  0.372
2015 Barg A, Mazumdar A, Wang R. Restricted Isometry Property of Random Subdictionaries Ieee Transactions On Information Theory. 61: 4440-4450. DOI: 10.1109/Tit.2015.2448658  0.506
2015 Barg A, Glazyrin A, Okoudjou KA, Yu WH. Finite two-distance tight frames Linear Algebra and Its Applications. 475: 163-175. DOI: 10.1016/J.Laa.2015.02.020  0.307
2015 Barg A, Skriganov M. Association schemes on general measure spaces and zero-dimensional Abelian groups Advances in Mathematics. 281: 142-247. DOI: 10.1016/J.Aim.2015.04.026  0.368
2014 Tamo I, Barg A. A family of optimal locally recoverable codes Ieee International Symposium On Information Theory - Proceedings. 686-690. DOI: 10.1109/Tit.2014.2321280  0.63
2014 Tamo I, Barg A. Bounds on locally recoverable codes with multiple recovering sets Ieee International Symposium On Information Theory - Proceedings. 691-695. DOI: 10.1109/ISIT.2014.6874921  0.589
2014 Gulcu TC, Barg A. Interactive function computation via polar coding 2014 52nd Annual Allerton Conference On Communication, Control, and Computing, Allerton 2014. 820-827. DOI: 10.1109/ALLERTON.2014.7028539  0.376
2014 Ye M, Barg A. Universal source polarization and an application to a multi-user problem 2014 52nd Annual Allerton Conference On Communication, Control, and Computing, Allerton 2014. 805-812. DOI: 10.1109/ALLERTON.2014.7028537  0.33
2014 Barg A, Felix LV, Firer M, Spreafico MVP. Linear codes on posets with extension property Discrete Mathematics. 317: 1-13. DOI: 10.1016/J.Disc.2013.11.001  0.577
2013 Mazumdar A, Barg A, Zemor G. Constructions of rank modulation codes Ieee Transactions On Information Theory. 59: 1018-1029. DOI: 10.1109/Tit.2012.2221121  0.714
2013 Barg A, Kabatiansky G. Robust parent-identifying codes and combinatorial arrays Ieee Transactions On Information Theory. 59: 994-1003. DOI: 10.1109/Tit.2012.2220522  0.53
2013 Park W, Barg A. Polar Codes for q-Ary Channels, q=2r Ieee Transactions On Information Theory. 59: 955-969. DOI: 10.1109/Tit.2012.2219035  0.422
2013 Barg A, Yu WH. New bounds for spherical two-distance sets Experimental Mathematics. 22: 187-194. DOI: 10.1080/10586458.2013.767725  0.327
2012 Barg A, Firer M. Translation association schemes, poset metrics, and the shape enumerator of codes Ieee International Symposium On Information Theory - Proceedings. 101-105. DOI: 10.1109/ISIT.2012.6283005  0.313
2011 Mazumdar A, Barg A, Kashyap N. Coding for high-density recording on a 1-D granular magnetic medium Ieee Transactions On Information Theory. 57: 7403-7417. DOI: 10.1109/Tit.2011.2158514  0.635
2011 Barg A, Mazumdar A. On the number of errors correctable with codes on graphs Ieee Transactions On Information Theory. 57: 910-919. DOI: 10.1109/Tit.2010.2094812  0.74
2011 Mazumdar A, Barg A. General constructions of deterministic (S)RIP matrices for compressive sampling Ieee International Symposium On Information Theory - Proceedings. 678-682. DOI: 10.1109/ISIT.2011.6034217  0.465
2011 Mazumdar A, Barg A. Channels with intermittent errors Ieee International Symposium On Information Theory - Proceedings. 1753-1757. DOI: 10.1109/ISIT.2011.6033849  0.604
2011 Barg A, Zémor G. List decoding of product codes by the MinSum algorithm Ieee International Symposium On Information Theory - Proceedings. 1273-1277. DOI: 10.1109/ISIT.2011.6033741  0.532
2011 Mazumdar A, Barg A, Zémor G. Parameters of rank modulation codes: Examples 2011 49th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2011. 13-17. DOI: 10.1109/Allerton.2011.6120143  0.669
2011 Mazumdar A, Barg A. Sparse recovery properties of statistical RIP matrices 2011 49th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2011. 9-12. DOI: 10.1109/Allerton.2011.6120142  0.528
2011 Barg A, Musin OR. Bounds on sets with few distances Journal of Combinatorial Theory. Series A. 118: 1465-1474. DOI: 10.1016/J.Jcta.2011.01.002  0.545
2011 Barg A, Kabatiansky G. Digital fingerprinting under and (Somewhat) beyond the marking assumption(Invited Talk) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6673: 202-205. DOI: 10.1007/978-3-642-20728-0_18  0.398
2010 Nitinawarat S, Ye C, Barg A, Narayan P, Reznik A. Secret key generation for a pairwise independent network model Ieee Transactions On Information Theory. 56: 6482-6489. DOI: 10.1109/Tit.2010.2081210  0.345
2010 Barg A, Mazumdar A. Codes in permutations and error correction for rank modulation Ieee International Symposium On Information Theory - Proceedings. 854-858. DOI: 10.1109/Tit.2010.2048455  0.747
2010 Mazumdar A, Barg A, Kashyap N. Codes for storage of data on a 1-d granular magnetic medium 2010 International Conference On Signal Processing and Communications, Spcom 2010. DOI: 10.1109/SPCOM.2010.5560471  0.561
2010 Mazumdar A, Barg A, Kashyap N. Coding for high-density magnetic recording Ieee International Symposium On Information Theory - Proceedings. 978-982. DOI: 10.1109/ISIT.2010.5513783  0.605
2010 Barg A, Purkayastha P. Near MDS poset codes and distributions Ieee International Symposium On Information Theory - Proceedings. 1310-1314. DOI: 10.1109/ISIT.2010.5513736  0.678
2010 Barg A, Musin OR. Bounds on codes with few distances Ieee International Symposium On Information Theory - Proceedings. 1115-1119. DOI: 10.1109/ISIT.2010.5513692  0.559
2010 Barg A, Mazumdar A. Small ensembles of sampling matrices constructed from coding theory Ieee International Symposium On Information Theory - Proceedings. 1963-1967. DOI: 10.1109/ISIT.2010.5513359  0.592
2010 Mazumdar A, Barg A, Kashyap N. On the capacity of high-density recording on a 1-D granular magnetic medium 2010 48th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2010. 368-375. DOI: 10.1109/ALLERTON.2010.5706930  0.521
2010 Park W, Barg A. Linear ordered codes, shape enumarators and parallel channels 2010 48th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2010. 361-367. DOI: 10.1109/ALLERTON.2010.5706929  0.503
2009 Anthapadmanabhan NP, Barg A. Two-level fingerprinting codes Ieee International Symposium On Information Theory - Proceedings. 2261-2265. DOI: 10.1109/ISIT.2009.5205886  0.781
2008 Barg A, Mazumdar A, Zémor G. Weight distribution and decoding of codes on hypergraphs Advances in Mathematics of Communications. 2: 433-450. DOI: 10.3934/Amc.2008.2.433  0.736
2008 Duggan A, Barg A. Performance analysis of algebraic soft-decision decoding of Reed-Solomon codes Ieee Transactions On Information Theory. 54: 5012-5018. DOI: 10.1109/Tit.2008.929969  0.558
2008 Anthapadmanabhan NP, Barg A, Dumer I. On the fingerprinting capacity under the marking assumption Ieee Transactions On Information Theory. 54: 2678-2689. DOI: 10.1109/Tit.2008.921859  0.794
2008 Barg A, Zémor G. Codes on hypergraphs Ieee International Symposium On Information Theory - Proceedings. 156-160. DOI: 10.1109/ISIT.2008.4594967  0.578
2008 Anthapadmanabhan NP, Barg A. Randomized frameproof codes: Fingerprinting plus validation minus tracing Ciss 2008, the 42nd Annual Conference On Information Sciences and Systems. 365-369. DOI: 10.1109/CISS.2008.4558553  0.81
2008 Barg A, Mazumdar A, Zémor G. Weight distribution of codes on hypergraphs 46th Annual Allerton Conference On Communication, Control, and Computing. 400-401. DOI: 10.1109/ALLERTON.2008.4797585  0.701
2007 Barg A, Musin OR. Codes in spherical caps Advances in Mathematics of Communications. 1: 131-149. DOI: 10.3934/Amc.2007.1.131  0.655
2007 Barg A, Purkayastha P. Bounds on ordered codes and orthogonal arrays Ieee International Symposium On Information Theory - Proceedings. 331-335. DOI: 10.17323/1609-4514-2009-9-2-211-243  0.713
2007 Duggan A, Barg A. Error bounds for Algebraic Soft-Decision Decoding of Reed-Solomon codes over additive-noise channels Ieee International Symposium On Information Theory - Proceedings. 2816-2820. DOI: 10.1109/ISIT.2007.4557645  0.435
2007 Anthapadmanabhan NP, Barg A, Dumer I. Fingerprinting capacity under the marking assumption Ieee International Symposium On Information Theory - Proceedings. 706-710. DOI: 10.1109/ISIT.2007.4557307  0.771
2006 Barg AM, Nogin DY. Spectral approach to linear programming bounds on codes Problems of Information Transmission. 42: 77-89. DOI: 10.1134/S0032946006020025  0.541
2006 Barg A, Zémor G. Distance properties of expander codes Ieee Transactions On Information Theory. 52: 78-90. DOI: 10.1109/Tit.2005.860415  0.616
2006 Prasanth Anthapadmanabhan N, Barg A. Random binary fingerprinting codes for arbitrarily sized coalitions Ieee International Symposium On Information Theory - Proceedings. 351-355. DOI: 10.1109/ISIT.2006.261612  0.479
2006 Barg A, Nogin D. A bound on Grassmannian codes Ieee International Symposium On Information Theory - Proceedings. 997-1000. DOI: 10.1016/J.Jcta.2006.03.025  0.608
2005 Barg A, McGregor A. Distance distribution of binary codes and the error probability of decoding Ieee Transactions On Information Theory. 51: 4237-4246. DOI: 10.1109/Tit.2005.858977  0.568
2005 Barg A, Zémor G. Concatenated codes: Serial and parallel Ieee Transactions On Information Theory. 51: 1625-1634. DOI: 10.1109/TIT.2005.846392  0.584
2005 Barg A, Zémor G. Multilevel expander codes Ieee International Symposium On Information Theory - Proceedings. 2005: 1315-1319. DOI: 10.1109/ISIT.2005.1523555  0.491
2004 Barg A, Zémor G. Error exponents of expander codes under linear-complexity decoding Siam Journal On Discrete Mathematics. 17: 426-445. DOI: 10.1137/S0895480102403799  0.65
2004 Barg A. Improved error bounds for the erasure/list scheme: The binary and spherical cases Ieee Transactions On Information Theory. 50: 2503-2511. DOI: 10.1109/Tit.2004.834753  0.584
2004 Barg A, Kabatiansky G. A class of I.P.P. codes with efficient identification Journal of Complexity. 20: 137-147. DOI: 10.1016/J.Jco.2003.08.012  0.437
2004 Barg A, McGregor A. List decoding of concatenated codes: Improved performance estimates Ieee International Symposium On Information Theory - Proceedings. 419.  0.579
2003 Barg A, Blakley GR, Kabatiansky GA. Digital fingerprinting codes: Problem statements, constructions, identification of traitors Ieee Transactions On Information Theory. 49: 852-865. DOI: 10.1109/Tit.2003.809570  0.526
2002 Barg A. On some polynomials related to weight enumerators of linear codes Siam Journal On Discrete Mathematics. 15: 155-164. DOI: 10.1137/S0895480199364148  0.595
2002 Barg A. A low-rate bound on the reliability of a quantum discrete memoryless channel Ieee Transactions On Information Theory. 48: 3096-3100. DOI: 10.1109/Tit.2002.805080  0.458
2002 Barg A, Nogin DY. Bounds on packings of spheres in the Grassmann manifold Ieee Transactions On Information Theory. 48: 2450-2454. DOI: 10.1109/Tit.2002.801469  0.473
2002 Barg A, Forney GD. Random codes: Minimum distances and error exponents Ieee International Symposium On Information Theory - Proceedings. 391. DOI: 10.1109/TIT.2002.800480  0.551
2001 Barg A, Cohen G, Encheva S, Kabatiansky G, Zémor G. A hypergraph approach to the identifying parent property: The case of multiple parents Siam Journal On Discrete Mathematics. 14: 423-431. DOI: 10.1137/S0895480100376848  0.43
2001 Barg A, Justesen J, Thommesen C. Concatenated codes with fixed inner code and random outer code Ieee Transactions On Information Theory. 47: 361-364. DOI: 10.1109/18.904536  0.651
2001 Ashikhmin A, Barg A, Litsyn S. Estimates of the distance distribution of codes and designs Ieee International Symposium On Information Theory - Proceedings. 111. DOI: 10.1016/S1571-0653(04)00152-0  0.617
2001 Ashikhmin A, Barg A, Litsyn S. Estimates of the Distance Distribution of Codes and Designs1 1 Research supported in part by Binational Science Foundation (BSF) under grant 1999099 Electronic Notes in Discrete Mathematics. 6: 4-14. DOI: 10.1016/S1571-0653(04)00152-0  0.531
2001 Ashikhmin A, Barg A, Vlǎduť S. Linear codes with exponentially many light vectors Journal of Combinatorial Theory. Series A. 96: 396-399. DOI: 10.1006/Jcta.2001.3206  0.575
2001 Ashikhmin A, Bandstra M, Barg A. Bounds on the covering radius of linear codes Ieee International Symposium On Information Theory - Proceedings. 38.  0.546
2001 Barg A, Blakley GR, Kabatiansky G. Good digital fingerprinting codes Ieee International Symposium On Information Theory - Proceedings. 161.  0.448
2000 Ashikhmin AE, Barg AM, Knill E, Litsyn SN. Quantum error detection II: bounds Ieee Transactions On Information Theory. 46: 789-800. DOI: 10.1109/18.841163  0.528
2000 Ashikhmin AE, Barg AM, Knill E, Litsyn SN, Known A. Quantum error detection I: statement of the problem Ieee Transactions On Information Theory. 46: 778-788. DOI: 10.1109/18.841162  0.403
2000 Barg A, Guritman S, Simonis J. Strengthening the Gilbert-Varshamov bound Linear Algebra and Its Applications. 307: 119-129. DOI: 10.1016/S0024-3795(99)00271-2  0.575
2000 Ashikhmin A, Barg A, Knill E, Litsyn S. Quantum error detection Ieee International Symposium On Information Theory - Proceedings. 275.  0.505
2000 Barg A. On polynomial invariants of codes, matroids, and the partition function Ieee International Symposium On Information Theory - Proceedings. 1.  0.564
1999 Barg A, Krouk E, Tilborg HCAv. On the complexity of minimum distance decoding of long linear codes Ieee Transactions On Information Theory. 45: 1392-1405. DOI: 10.1109/18.771141  0.583
1999 Ashikhmin A, Barg A, Litsyn S. New upper bounds on generalized weights Ieee Transactions On Information Theory. 45: 1258-1263. DOI: 10.1109/18.761280  0.561
1999 Barg A, Ashikhmin A. Binomial Moments of the Distance Distribution and the Probability of Undetected Error Designs, Codes, and Cryptography. 16: 103-116. DOI: 10.1023/A:1008382528138  0.59
1998 Ashikhmin A, Barg A. Minimal vectors in linear codes Ieee Transactions On Information Theory. 44: 2010-2017. DOI: 10.1109/18.705584  0.61
1997 Barg A. The Matroid of Supports of A Linear Code Applicable Algebra in Engineering, Communication and Computing. 8: 165-172. DOI: 10.1007/S002000050060  0.554
1997 Barg A. Minimum Distance Decoding Algorithms for Linear Codes Applicable Algebra in Engineering, Communication and Computing. 1-14. DOI: 10.1007/3-540-63163-1_1  0.469
1996 Barg A. Two families of low-correlated binary sequences Applicable Algebra in Engineering, Communication and Computing. 7: 433-437. DOI: 10.1007/Bf01293261  0.408
1995 Ashikhmin AE, Barg A, Cohen G, Rotger LHi. Variations on Minimal Codewords in Linear Codes Applicable Algebra in Engineering, Communication and Computing. 96-105. DOI: 10.1007/3-540-60114-7_7  0.607
1993 Barg A. At the Dawn of the Theory of Codes The Mathematical Intelligencer. 15: 20-26. DOI: 10.1007/Bf03025254  0.533
1993 Barg A. Incomplete sums, DC-constrained codes, and codes that maintain synchronization Designs, Codes and Cryptography. 3: 105-116. DOI: 10.1007/Bf01388409  0.614
Show low-probability matches.