default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Barg
Alexander M. Barg
Person information
- affiliation: University of Maryland, College Park, USA
- affiliation: Russian Academy of Sciences, Moscow, Russia
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]Alexander Barg, Moshe Schwartz, Lev Yohananov:
Storage Codes on Coset Graphs with Asymptotically Unit Rate. Comb. 44(6): 1193-1209 (2024)- [j84]Alexander Barg, Alexey A. Glazyrin, Wei-Jiun Kao, Ching-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu:
On the size of maximal binary codes with 2, 3, and 4 distances. Comb. Theory 4(1) (2024) - [c77]Adway Patra, Alexander Barg:
More Results for Regenerating Codes on Graphs. ISIT 2024: 813-818 - [c76]Arda Aydin, Max A. Alekseyev, Alexander Barg:
A Family of Permutationally Invariant Quantum Codes. ISIT 2024: 2706-2711 - [i82]Madhura Pathegama, Alexander Barg:
Rényi divergence guarantees for hashing with linear codes. CoRR abs/2405.04406 (2024) - [i81]Adway Patra, Alexander Barg:
Generalized regenerating codes and node repair on graphs. CoRR abs/2405.11714 (2024) - [i80]Madhura Pathegama, Alexander Barg:
Limitations of the decoding-to-LPN reduction via code smoothing. CoRR abs/2408.03742 (2024) - [i79]Arda Aydin, Alexander Barg:
Class of codes correcting absorptions and emissions. CoRR abs/2410.03562 (2024) - [i78]Alexander Barg, Nolan J. Coble, Dominik Hangleiter, Christopher Kang:
Geometric structure and transversal logic of quantum Reed-Muller codes. CoRR abs/2410.07595 (2024) - [i77]Madhura Pathegama, Alexander Barg:
Rényi divergence-based uniformity guarantees for k-universal hash functions. CoRR abs/2410.16459 (2024) - 2023
- [j83]Alexander Barg
, Peter G. Boyvalenkov, Maya Stoyanova:
Bounds for the sum of distances of spherical sets of small size. Discret. Math. 346(5): 113346 (2023) - [j82]Madhura Pathegama, Alexander Barg:
Smoothing of Binary Codes, Uniform Distributions, and Applications. Entropy 25(11): 1515 (2023) - [c75]Adway Patra, Alexander Barg:
Node Repair for Adversarial Graphical Networks. ISIT 2023: 2284-2289 - [i76]Shubham P. Jain, Joseph T. Iosue, Alexander Barg, Victor V. Albert:
Quantum spherical codes. CoRR abs/2302.11593 (2023) - [i75]Madhura Pathegama, Alexander Barg:
Smoothing of binary codes, uniform distributions, and applications. CoRR abs/2308.11009 (2023) - [i74]Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, Eitan Yaakobi:
Storage codes and recoverable systems on lines and grids. CoRR abs/2308.14558 (2023) - [i73]Arda Aydin, Max A. Alekseyev, Alexander Barg:
A family of permutationally invariant quantum codes. CoRR abs/2310.05358 (2023) - 2022
- [j81]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. Des. Codes Cryptogr. 90(4): 939-945 (2022) - [j80]Adway Patra, Alexander Barg:
Node Repair on Connected Graphs. IEEE Trans. Inf. Theory 68(5): 3081-3095 (2022) - [j79]Ohad Elishco, Alexander Barg:
Recoverable Systems. IEEE Trans. Inf. Theory 68(6): 3681-3699 (2022) - [j78]Alexander Barg, Gilles Zémor:
High-Rate Storage Codes on Triangle-Free Graphs. IEEE Trans. Inf. Theory 68(12): 7787-7797 (2022) - [c74]Adway Patra, Alexander Barg:
Interior-point regenerating codes on graphs. ISIT 2022: 1560-1565 - [c73]Alexander Barg, Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Recoverable systems on lines and grids. ISIT 2022: 2637-2642 - [i72]Alexander Barg, Alexey A. Glazyrin, Wei-Jiun Kao, Ching-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu:
On the size of maximal binary codes with 2, 3, and 4 distances. CoRR abs/2210.07496 (2022) - [i71]Adway Patra, Alexander Barg:
Node repair on connected graphs, Part II. CoRR abs/2211.00797 (2022) - [i70]Alexander Barg, Moshe Schwartz, Lev Yohananov:
Storage codes on triangle-free graphs with asymptotically unit rate. CoRR abs/2212.12117 (2022) - 2021
- [j77]Alexander Barg, Maxim Skriganov:
Bounds for discrepancies in the Hamming space. J. Complex. 65: 101552 (2021) - [j76]Ohad Elishco, Alexander Barg:
Capacity of Dynamical Storage Systems. IEEE Trans. Inf. Theory 67(1): 329-346 (2021) - [j75]Zitan Chen, Alexander Barg:
Cyclic and Convolutional Codes With Locality. IEEE Trans. Inf. Theory 67(2): 755-769 (2021) - [j74]Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor:
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". IEEE Trans. Inf. Theory 67(6): 3187-3189 (2021) - [c72]Adway Patra, Alexander Barg:
Regenerating codes on graphs. ISIT 2021: 2197-2202 - [c71]Ohad Elishco, Alexander Barg:
Capacity and Construction of Recoverable Systems. ISIT 2021: 3273-3278 - [i69]Alexander Barg, Peter G. Boyvalenkov, Maya Stoyanova:
Bounds for the sum of distances of spherical sets of small size. CoRR abs/2105.03511 (2021) - [i68]Adway Patra, Alexander Barg:
Node repair on connected graphs. CoRR abs/2108.00939 (2021) - [i67]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. CoRR abs/2108.08679 (2021) - [i66]Alexander Barg, Gilles Zémor:
High-rate storage codes on triangle-free graphs. CoRR abs/2110.02378 (2021) - 2020
- [j73]Zitan Chen, Alexander Barg:
Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model. IEEE Trans. Inf. Theory 66(2): 886-899 (2020) - [j72]Itzhak Tamo, Min Ye, Alexander Barg:
Error Correction Based on Partial Information. IEEE Trans. Inf. Theory 66(3): 1396-1404 (2020) - [j71]Zitan Chen, Min Ye, Alexander Barg:
Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes. IEEE Trans. Inf. Theory 66(12): 7439-7456 (2020) - [j70]Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, Alexander Barg:
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. ACM Trans. Storage 16(2): 11:1-11:32 (2020) - [c70]Zitan Chen, Min Ye, Alexander Barg:
Repair of RS codes with optimal access and error correction. ISIT 2020: 589-594 - [c69]Zitan Chen, Alexander Barg:
Cyclic LRC codes with hierarchy and availability. ISIT 2020: 616-621 - [i65]Zitan Chen, Min Ye, Alexander Barg:
Enabling optimal access and error correction for the repair of Reed-Solomon codes. CoRR abs/2001.07189 (2020) - [i64]Zitan Chen, Alexander Barg:
Cyclic and convolutional codes with locality. CoRR abs/2004.06770 (2020) - [i63]Alexander Barg:
Stolarsky's invariance principle for finite metric spaces. CoRR abs/2005.12995 (2020) - [i62]Alexander Barg, Maxim Skriganov:
Bounds for discrepancies in the Hamming space. CoRR abs/2007.09721 (2020) - [i61]Ohad Elishco, Alexander Barg:
Recoverable Systems. CoRR abs/2010.00589 (2020)
2010 – 2019
- 2019
- [j69]Min Ye, Alexander Barg:
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters. IEEE Trans. Inf. Theory 65(3): 1639-1656 (2019) - [j68]Itzhak Tamo, Min Ye, Alexander Barg:
The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size. IEEE Trans. Inf. Theory 65(5): 2673-2695 (2019) - [j67]Sean Ballentine, Alexander Barg, Serge G. Vladut:
Codes With Hierarchical Locality From Covering Maps of Curves. IEEE Trans. Inf. Theory 65(10): 6056-6071 (2019) - [c68]Zitan Chen, Alexander Barg:
Explicit constructions of MSR codes for the rack-aware storage model. ISIT 2019: 226-230 - [c67]Ohad Elishco, Alexander Barg:
Capacity of dynamical storage systems. ISIT 2019: 1562-1566 - [i60]Zitan Chen, Alexander Barg:
Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model. CoRR abs/1901.04419 (2019) - [i59]Ohad Elishco, Alexander Barg:
Capacity of dynamical storage systems. CoRR abs/1908.09900 (2019) - 2018
- [j66]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Trans. Commun. 66(6): 2346-2358 (2018) - [j65]Talha Cihad Gülcü, Min Ye, Alexander Barg:
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels. IEEE Trans. Inf. Theory 64(1): 309-321 (2018) - [j64]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. IEEE Trans. Inf. Theory 64(5): 3481-3492 (2018) - [j63]Min Ye, Alexander Barg:
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy. IEEE Trans. Inf. Theory 64(8): 5662-5676 (2018) - [c66]Zitan Chen, Alexander Barg:
The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage. Allerton 2018: 710-714 - [c65]Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi:
Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018: 139-154 - [c64]Sean Ballentine, Alexander Barg:
Codes on Curves with Hierarchical Locality. ISIT 2018: 1201-1205 - [c63]Min Ye, Alexander Barg:
Optimal Regenerating Codes for Cooperative Repair. ISIT 2018: 1939-1943 - [c62]Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, Alexander Barg:
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. USENIX ATC 2018: 865-877 - [i58]Min Ye, Alexander Barg:
Optimal MDS codes for cooperative repair. CoRR abs/1801.09665 (2018) - [i57]Oleg Kolosov, Alexander Barg, Itzhak Tamo, Gala Yadgar:
Optimal LRC codes for all lenghts n≤q. CoRR abs/1802.00157 (2018) - [i56]Itzhak Tamo, Min Ye, Alexander Barg:
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size. CoRR abs/1805.01883 (2018) - [i55]Sean Ballentine, Alexander Barg, Serge G. Vladut:
Codes with hierarchical locality from covering maps of curves. CoRR abs/1807.05473 (2018) - [i54]Min Ye, Alexander Barg:
Optimal locally private estimation under 𝓁p loss for 1≤ p≤ 2. CoRR abs/1810.07283 (2018) - 2017
- [j62]Talha Cihad Gülcü, Alexander Barg:
Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component. IEEE Trans. Inf. Theory 63(2): 1311-1324 (2017) - [j61]Min Ye, Alexander Barg:
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth. IEEE Trans. Inf. Theory 63(4): 2001-2014 (2017) - [j60]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally Recoverable Codes on Algebraic Curves. IEEE Trans. Inf. Theory 63(8): 4928-4939 (2017) - [j59]Min Ye, Alexander Barg:
Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization. IEEE Trans. Inf. Theory 63(10): 6307-6317 (2017) - [j58]Alexander Barg, Arya Mazumdar:
Group Testing Schemes From Codes and Designs. IEEE Trans. Inf. Theory 63(11): 7131-7141 (2017) - [c61]Itzhak Tamo, Min Ye, Alexander Barg:
Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. FOCS 2017: 216-227 - [c60]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A study on the impact of locality in the decoding of binary cyclic codes. ISIT 2017: 176-180 - [c59]Min Ye, Alexander Barg:
Optimal schemes for discrete distribution estimation under local differential privacy. ISIT 2017: 759-763 - [c58]Itzhak Tamo, Min Ye, Alexander Barg:
Fractional decoding: Error correction from partial information. ISIT 2017: 998-1002 - [i53]Alexander Barg, Kathryn Haymaker, Everett W. Howe, Gretchen L. Matthews, Anthony Várilly-Alvarado:
Locally recoverable codes from algebraic curves and surfaces. CoRR abs/1701.05212 (2017) - [i52]Itzhak Tamo, Min Ye, Alexander Barg:
Fractional decoding: Error correction from partial information. CoRR abs/1701.06969 (2017) - [i51]Min Ye, Alexander Barg:
Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacy. CoRR abs/1702.00610 (2017) - [i50]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. CoRR abs/1702.02685 (2017) - [i49]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. CoRR abs/1702.03786 (2017) - [i48]Itzhak Tamo, Min Ye, Alexander Barg:
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound. CoRR abs/1706.00112 (2017) - [i47]Min Ye, Alexander Barg:
Asymptotically optimal private estimation under mean square loss. CoRR abs/1708.00059 (2017) - [i46]Min Ye, Alexander Barg:
Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures. CoRR abs/1710.07216 (2017) - 2016
- [j57]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. Int. J. Inf. Coding Theory 3(4): 345-364 (2016) - [j56]Talha Cihad Gülcü, Alexander M. Barg:
Interactive function computation via polar coding. Probl. Inf. Transm. 52(1): 66-91 (2016) - [j55]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. IEEE Trans. Inf. Theory 62(6): 3070-3083 (2016) - [c57]Talha Cihad Gülcü, Min Ye, Alexander Barg:
Construction of polar codes for arbitrary discrete memoryless channels. ISIT 2016: 51-55 - [c56]Sihuang Hu, Itzhak Tamo, Alexander Barg:
Combinatorial and LP bounds for LRC codes. ISIT 2016: 1008-1012 - [c55]Min Ye, Alexander Barg:
Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth. ISIT 2016: 1202-1206 - [c54]Shashanka Ubaru, Arya Mazumdar, Alexander Barg:
Group testing schemes from low-weight codewords of BCH codes. ISIT 2016: 2863-2867 - [i45]Talha Cihad Gülcü, Min Ye, Alexander Barg:
Construction of polar codes for arbitrary discrete memoryless channels. CoRR abs/1603.05736 (2016) - [i44]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. CoRR abs/1603.08876 (2016) - [i43]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes. CoRR abs/1603.08878 (2016) - [i42]Min Ye, Alexander Barg:
Explicit constructions of high-rate MDS array codes with optimal repair bandwidth. CoRR abs/1604.00454 (2016) - [i41]Min Ye, Alexander Barg:
Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization. CoRR abs/1605.08630 (2016) - 2015
- [j54]Min Ye, Alexander Barg:
Polar codes for distributed hierarchical source coding. Adv. Math. Commun. 9(1): 87-103 (2015) - [j53]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Restricted Isometry Property of Random Subdictionaries. IEEE Trans. Inf. Theory 61(8): 4440-4450 (2015) - [c53]Min Ye, Alexander Barg:
Polar codes using dynamic kernels. ISIT 2015: 231-235 - [c52]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. ISIT 2015: 1252-1256 - [c51]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC codes and their subfield subcodes. ISIT 2015: 1262-1266 - [c50]Talha Cihad Gülcü, Alexander Barg:
Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component. ITW 2015: 1-5 - [i40]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. CoRR abs/1501.04904 (2015) - [i39]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC Codes and their Subfield Subcodes. CoRR abs/1502.01414 (2015) - [i38]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Restricted isometry property of random subdictionaries. CoRR abs/1506.06345 (2015) - [i37]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. CoRR abs/1506.07196 (2015) - [i36]Alexander Barg, Arya Mazumdar:
Almost disjunct matrices from codes and designs. CoRR abs/1510.02873 (2015) - 2014
- [j52]Alexander Barg, Luciano Vianna Felix, Marcelo Firer, Marcos Vinicius Spreafico:
Linear codes on posets with extension property. Discret. Math. 317: 1-13 (2014) - [j51]Itzhak Tamo, Alexander Barg:
A Family of Optimal Locally Recoverable Codes. IEEE Trans. Inf. Theory 60(8): 4661-4676 (2014) - [c49]Min Ye, Alexander Barg:
Universal source polarization and an application to a multi-user problem. Allerton 2014: 805-812 - [c48]Talha Cihad Gülcü, Alexander Barg:
Interactive function computation via polar coding. Allerton 2014: 820-827 - [c47]Itzhak Tamo, Alexander Barg:
A family of optimal locally recoverable codes. ISIT 2014: 686-690 - [c46]Itzhak Tamo, Alexander Barg:
Bounds on locally recoverable codes with multiple recovering sets. ISIT 2014: 691-695 - [e4]Alexander Barg, Oleg R. Musin:
Discrete Geometry and Algebraic Combinatorics. Contemporary Mathematics 625, American Mathematical Society 2014, ISBN 978-1-4704-0905-0 [contents] - [i35]Itzhak Tamo, Alexander Barg:
Bounds on Locally Recoverable Codes with Multiple Recovering Sets. CoRR abs/1402.0916 (2014) - [i34]Min Ye, Alexander Barg:
Polar Codes for Distributed Hierarchical Source Coding. CoRR abs/1404.5501 (2014) - [i33]Talha Cihad Gülcü, Alexander Barg:
Interactive Function Computation via Polar Coding. CoRR abs/1405.0894 (2014) - [i32]Min Ye, Alexander Barg:
Universal Source Polarization and an Application to a Multi-User Problem. CoRR abs/1408.6824 (2014) - [i31]Talha Cihad Gülcü, Alexander Barg:
Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel with a Confidential Component. CoRR abs/1410.3422 (2014) - 2013
- [j50]Alexander Barg, Wei-Hsuan Yu:
New Bounds for Spherical Two-Distance Sets. Exp. Math. 22(2): 187-194 (2013) - [j49]Woomyoung Park, Alexander Barg:
Polar Codes for $q$-Ary Channels, $q=2^{r}$. IEEE Trans. Inf. Theory 59(2): 955-969 (2013) - [j48]Alexander Barg, Grigory Kabatiansky:
Robust Parent-Identifying Codes and Combinatorial Arrays. IEEE Trans. Inf. Theory 59(2): 994-1003 (2013) - [j47]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of Rank Modulation Codes. IEEE Trans. Inf. Theory 59(2): 1018-1029 (2013) - [c45]Alexander Barg, Wei-Hsuan Yu:
New bounds for equiangular lines. Discrete Geometry and Algebraic Combinatorics 2013 - [c44]Woomyoung Park, Alexander Barg:
Controlled polarization for q-ary alphabets. ISIT 2013: 1307-1311 - [i30]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery. CoRR abs/1303.1847 (2013) - [i29]Alexander Barg, Marcelo Firer, Marcos Vinicius Spreafico, Luciano Vianna Felix:
Linear codes on posets with extension property. CoRR abs/1304.2263 (2013) - [i28]Alexander Barg, Maxim Skriganov:
Association schemes on general measure spaces and zero-dimensional Abelian groups. CoRR abs/1310.5359 (2013) - [i27]Itzhak Tamo, Alexander Barg:
A family of optimal locally recoverable codes. CoRR abs/1311.3284 (2013) - 2012
- [c43]Alexander Barg, Marcelo Firer:
Translation association schemes, poset metrics, and the shape enumerator of codes. ISIT 2012: 101-105 - [c42]Woomyoung Park, Alexander Barg:
Polar codes for q-ary channels, q=2r. ISIT 2012: 2142-2146 - 2011
- [j46]Alexander Barg, Oleg R. Musin:
Bounds on sets with few distances. J. Comb. Theory A 118(4): 1465-1474 (2011) - [j45]Alexander Barg, Arya Mazumdar:
On the Number of Errors Correctable with Codes on Graphs. IEEE Trans. Inf. Theory 57(2): 910-919 (2011) - [j44]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. IEEE Trans. Inf. Theory 57(11): 7403-7417 (2011) - [c41]Arya Mazumdar, Alexander Barg:
Sparse recovery properties of statistical RIP matrices. Allerton 2011: 9-12 - [c40]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Parameters of rank modulation codes: Examples. Allerton 2011: 13-17 - [c39]Woomyoung Park, Alexander Barg:
Multilevel polarization for nonbinary codes and parallel channels. Allerton 2011: 228-234 - [c38]Alexander Barg, Grigory Kabatiansky:
Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk). ICITS 2011: 202-205 - [c37]Arya Mazumdar, Alexander Barg:
General constructions of deterministic (S)RIP matrices for compressive sampling. ISIT 2011: 678-682 - [c36]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of rank modulation codes. ISIT 2011: 869-873 - [c35]Alexander Barg, Gilles Zémor:
List decoding of product codes by the MinSum algorithm. ISIT 2011: 1273-1277 - [c34]Arya Mazumdar, Alexander Barg:
Channels with intermittent errors. ISIT 2011: 1753-1757 - [c33]Woomyoung Park, Alexander Barg:
The ordered Hamming metric and ordered symmetric channels. ISIT 2011: 2283-2287 - [r2]Alexander Barg, Gregory A. Kabatiansky:
Fingerprinting. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 465-467 - [i26]Woomyoung Park, Alexander Barg:
Multilevel polarization for nonbinary codes and parallel channels. CoRR abs/1107.4965 (2011) - [i25]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of Rank Modulation Codes. CoRR abs/1110.2557 (2011) - [i24]Alexander Barg, Grigory Kabatiansky:
Robust parent-identifying codes and combinatorial arrays. IACR Cryptol. ePrint Arch. 2011: 227 (2011) - 2010
- [j43]Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. IEEE Trans. Inf. Theory 56(7): 3158-3165 (2010) - [j42]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. IEEE Trans. Inf. Theory 56(12): 6482-6489 (2010) - [c32]Woomyoung Park, Alexander Barg:
Linear ordered codes, shape enumarators and parallel channels. Allerton 2010: 361-367 - [c31]Arya Mazumdar, Alexander Barg, Navin Kashyap:
On the capacity of high-density recording on a 1-D granular magnetic medium. Allerton 2010: 368-375 - [c30]Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. ISIT 2010: 854-858 - [c29]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for high-density magnetic recording. ISIT 2010: 978-982 - [c28]Alexander Barg, Oleg R. Musin:
Bounds on codes with few distances. ISIT 2010: 1115-1119 - [c27]Alexander Barg, Punarbasu Purkayastha:
Near MDS poset codes and distributions. ISIT 2010: 1310-1314 - [c26]Alexander Barg, Arya Mazumdar:
Small ensembles of sampling matrices constructed from coding theory. ISIT 2010: 1963-1967 - [c25]N. Prasanth Anthapadmanabhan, Alexander Barg:
Two-level fingerprinting: Stronger definitions and code constructions. ISIT 2010: 2528-2532 - [c24]Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier:
Robust parent-identifying codes. ITW 2010: 1-4 - [e3]Marcus Greferath, Joachim Rosenthal, Alexander Barg, Gilles Zémor:
2010 IEEE Information Theory Workshop, ITW 2010, Dublin, Ireland, August 30 - September 3, 2010. IEEE 2010, ISBN 978-1-4244-8264-1 [contents] - [i23]Alexander Barg, Punarbasu Purkayastha:
Near MDS poset codes and distributions. CoRR abs/1004.5601 (2010) - [i22]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. CoRR abs/1007.3518 (2010) - [i21]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. CoRR abs/1012.1895 (2010)
2000 – 2009
- 2009
- [c23]Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik:
Perfect secrecy, perfect omniscience and steiner tree packing. ISIT 2009: 1288-1292 - [c22]N. Prasanth Anthapadmanabhan, Alexander Barg:
Two-level fingerprinting codes. ISIT 2009: 2261-2265 - [c21]Alexander Barg, Arya Mazumdar:
On the number of errors correctable with codes on graphs. ISIT 2009: 2482-2486 - [i20]N. Prasanth Anthapadmanabhan, Alexander Barg:
Two-Level Fingerprinting Codes. CoRR abs/0905.0417 (2009) - [i19]Alexander Barg, Oleg R. Musin:
Bounds on sets with few distances. CoRR abs/0905.2423 (2009) - [i18]Alexander Barg, Arya Mazumdar:
Codes in Permutations and Error Correction for Rank Modulation. CoRR abs/0908.4094 (2009) - [i17]Alexander Barg, Arya Mazumdar:
On the Number of Errors Correctable with Codes on Graphs. CoRR abs/0911.4522 (2009) - 2008
- [j41]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution and decoding of codes on hypergraphs. Adv. Math. Commun. 2(4): 433-450 (2008) - [j40]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption. IEEE Trans. Inf. Theory 54(6): 2678-2689 (2008) - [j39]Andrew Duggan, Alexander Barg:
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes. IEEE Trans. Inf. Theory 54(11): 5012-5018 (2008) - [c20]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Common Randomness, Multiuser Secrecy and Tree Packing. Allerton 2008: 217-220 - [c19]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution of codes on hypergraphs. Allerton 2008: 400-401 - [c18]Alexander Barg, Gilles Zémor:
Codes on hypergraphs. ISIT 2008: 156-160 - [c17]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret key generation for a pairwise independent network model. ISIT 2008: 1015-1019 - [i16]N. Prasanth Anthapadmanabhan, Alexander Barg:
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing. CoRR abs/0802.3419 (2008) - [i15]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Codes on hypergraphs. CoRR abs/0808.3453 (2008) - [i14]Alexander Barg, Dmitry Yu. Nogin:
A functional view of upper bounds on codes. CoRR abs/0809.0091 (2008) - 2007
- [j38]Alexander Barg, Oleg R. Musin:
Codes in spherical caps. Adv. Math. Commun. 1(1): 131-149 (2007) - [c16]Alexander Barg, Punarbasu Purkayastha:
Bounds on ordered codes and orthogonal arrays. ISIT 2007: 331-335 - [c15]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
Fingerprinting Capacity Under the Marking Assumption. ISIT 2007: 706-710 - [c14]Andrew Duggan, Alexander Barg:
Error Bounds for Algebraic Soft-Decision Decoding of Reed-Solomon Codes over Additive-Noise Channels. ISIT 2007: 2816-2820 - [i13]Andrew Duggan, Alexander Barg:
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes. CoRR abs/cs/0701018 (2007) - [i12]Alexander Barg, Punarbasu Purkayastha:
Bounds on ordered codes and orthogonal arrays. CoRR abs/cs/0702033 (2007) - 2006
- [j37]Alexander Barg, Dmitry Yu. Nogin:
A bound on Grassmannian codes. J. Comb. Theory A 113(8): 1629-1635 (2006) - [j36]Alexander M. Barg, Dmitry Yu. Nogin:
Spectral approach to linear programming bounds on codes. Probl. Inf. Transm. 42(2): 77-89 (2006) - [j35]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. IEEE Trans. Inf. Theory 52(1): 78-90 (2006) - [c13]N. Prasanth Anthapadmanabhan, Alexander Barg:
Random Binary Fingerprinting Codes for Arbitrarily Sized Coalitions. ISIT 2006: 351-355 - [c12]Alexander Barg, Dmitry Yu. Nogin:
A bound on Grassmannian codes. ISIT 2006: 997-1000 - [i11]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption. CoRR abs/cs/0612073 (2006) - [i10]Alexander Barg, Oleg R. Musin:
Codes in spherical caps. CoRR abs/math/0606734 (2006) - 2005
- [j34]Alexander Barg, Gilles Zémor:
Concatenated codes: serial and parallel. IEEE Trans. Inf. Theory 51(5): 1625-1634 (2005) - [j33]Alexander Barg, Dmitry Yu. Nogin:
Correction to "Bounds on Packings of Spheres in the Grassmann Manifold". IEEE Trans. Inf. Theory 51(7): 2732- (2005) - [j32]Alexander Barg, Andrew McGregor:
Distance distribution of binary codes and the error probability of decoding. IEEE Trans. Inf. Theory 51(12): 4237-4246 (2005) - [c11]Alexander Barg, Gilles Zémor:
Multilevel expander codes. ISIT 2005: 1315-1319 - [e2]Alexei E. Ashikhmin, Alexander Barg:
Algebraic Coding Theory and Information Theory, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, December 15-18, 2003. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 68, DIMACS/AMS 2005, ISBN 978-0-8218-3626-2 [contents] - [r1]Alexander Barg, Gregory A. Kabatiansky:
Fingerprinting. Encyclopedia of Cryptography and Security 2005 - [i9]Alexander Barg, Gilles Zémor:
Multilevel expander codes. CoRR abs/cs/0502079 (2005) - [i8]Alexander Barg, Dmitry Yu. Nogin:
A bound on Grassmannian codes. CoRR abs/cs/0512024 (2005) - [i7]Alexander Barg, Dmitry Yu. Nogin:
Spectral approach to linear programming bounds on codes. CoRR abs/cs/0512025 (2005) - 2004
- [j31]Alexander Barg, Gregory A. Kabatiansky:
A class of I.P.P. codes with efficient identification. J. Complex. 20(2-3): 137-147 (2004) - [j30]Alexander Barg, Gilles Zémor:
Error Exponents of Expander Codes under Linear-Complexity Decoding. SIAM J. Discret. Math. 17(3): 426-445 (2004) - [j29]Alexander Barg:
Improved error bounds for the erasure/list scheme: the binary and spherical cases. IEEE Trans. Inf. Theory 50(10): 2503-2514 (2004) - [c10]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. ISIT 2004: 5 - [c9]Alexander Barg, Andrew McGregor:
List decoding of concatenated codes: improved performance estimates. ISIT 2004: 419 - [i6]Alexander Barg:
On the asymptotic accuracy of the union bound. CoRR abs/cs/0412111 (2004) - [i5]Alexander Barg:
Improved error bounds for the erasure/list scheme: the binary and spherical cases. CoRR cs.IT/0407010 (2004) - [i4]Alexander Barg, Andrew McGregor:
Distance distribution of binary codes and the error probability of decoding. CoRR cs.IT/0407011 (2004) - [i3]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. CoRR cs.IT/0409010 (2004) - 2003
- [j28]Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4): 852-865 (2003) - [c8]Alexander Barg, Gilles Zémor:
Multilevel expander codes. Algebraic Coding Theory and Information Theory 2003: 69-84 - 2002
- [j27]Alexei E. Ashikhmin, Alexander Barg:
Bounds on the Covering Radius of Linear Codes. Des. Codes Cryptogr. 27(3): 261-269 (2002) - [j26]Alexander Barg:
On Some Polynomials Related to Weight Enumerators of Linear Codes. SIAM J. Discret. Math. 15(2): 155-164 (2002) - [j25]Alexander Barg, Gilles Zémor:
Error exponents of expander codes. IEEE Trans. Inf. Theory 48(6): 1725-1729 (2002) - [j24]Alexander Barg, Dmitry Yu. Nogin:
Bounds on packings of spheres in the Grassmann manifold. IEEE Trans. Inf. Theory 48(9): 2450-2454 (2002) - [j23]Alexander Barg, G. David Forney Jr.:
Random codes: Minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9): 2568-2573 (2002) - [j22]Alexander Barg:
A low-rate bound on the reliability of a quantum discrete memoryless channel. IEEE Trans. Inf. Theory 48(12): 3096-3100 (2002) - 2001
- [j21]Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Grigory Kabatiansky, Gilles Zémor:
A hypergraph approach to the identifying parent property: the case of multiple parents. Electron. Notes Discret. Math. 6: 1-3 (2001) - [j20]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the Distance Distribution of Codes and Designs. Electron. Notes Discret. Math. 6: 4-14 (2001) - [j19]Alexei E. Ashikhmin, Alexander Barg, Serge G. Vladut:
Linear Codes with Exponentially Many Light Vectors. J. Comb. Theory A 96(2): 396-399 (2001) - [j18]Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor:
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents. SIAM J. Discret. Math. 14(3): 423-431 (2001) - [j17]Alexander Barg, Jørn Justesen, Christian Thommesen:
Concatenated codes with fixed inner code and random outer code. IEEE Trans. Inf. Theory 47(1): 361-365 (2001) - [j16]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of codes and designs. IEEE Trans. Inf. Theory 47(3): 1050-1061 (2001) - [e1]Alexander Barg, Simon Litsyn:
Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56, DIMACS/AMS 2001, ISBN 978-0-8218-2074-2 [contents] - 2000
- [j15]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection I: Statement of the problem. IEEE Trans. Inf. Theory 46(3): 778-788 (2000) - [j14]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection II: Bounds. IEEE Trans. Inf. Theory 46(3): 789-800 (2000) - [j13]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
A new upper bound on the reliability function of the Gaussian channel. IEEE Trans. Inf. Theory 46(6): 1945-1961 (2000)
1990 – 1999
- 1999
- [j12]Alexander Barg, Alexei E. Ashikhmin:
Binomial Moments of the Distance Distribution and the Probability of Undetected Error. Des. Codes Cryptogr. 16(2): 103-116 (1999) - [j11]Alexei E. Ashikhmin, Alexander Barg:
Binomial Moments of the Distance Distribution: Bounds and Applications. IEEE Trans. Inf. Theory 45(2): 438-452 (1999) - [j10]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
New Upper Bounds on Generalized Weights. IEEE Trans. Inf. Theory 45(4): 1258-1263 (1999) - [j9]Alexander Barg, E. A. Krouk, Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes. IEEE Trans. Inf. Theory 45(5): 1392-1405 (1999) - [j8]Alexander Barg, Shiyu Zhou:
Linear-time binary codes correcting localized erasures. IEEE Trans. Inf. Theory 45(7): 2547-2552 (1999) - [c7]Alexander Barg, David B. Jaffe:
Numerical results on the asymptotic rate of binary codes. Codes and Association Schemes 1999: 25-32 - [c6]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of nonbinary codes, with applications. Codes and Association Schemes 1999: 287-301 - [i2]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Polynomial method in coding and information theory. CoRR math.CO/9910175 (1999) - 1998
- [j7]Alexei E. Ashikhmin, Alexander Barg:
Minimal Vectors in Linear Codes. IEEE Trans. Inf. Theory 44(5): 2010-2017 (1998) - 1997
- [j6]Alexander Barg:
The Matroid of Supports of A Linear Code. Appl. Algebra Eng. Commun. Comput. 8(2): 165-172 (1997) - [j5]Alexander Barg:
A large family of sequences with low periodic correlation. Discret. Math. 176(1-3): 21-27 (1997) - [c5]Alexander Barg:
Minimum Distance Decoding Algorithms for Linear Codes. AAECC 1997: 1-14 - [i1]Alexander Barg:
Complexity Issues in Coding Theory. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j4]Alexander Barg:
Two families of low-correlated binary sequences. Appl. Algebra Eng. Commun. Comput. 7(6): 433-437 (1996) - 1995
- [c4]Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger:
Variations on Minimal Codewords in Linear Codes. AAECC 1995: 96-105 - [c3]Valeri Korjik, Michael Ivkov, Yuri Merinovich, Alexander Barg, Henk C. A. van Tilborg:
A Broadcast Key Distribution Scheme Based on Block Designs. IMACC 1995: 2-12 - [c2]Alexei E. Ashikhmin, Alexander Barg:
Minimal Supports in Linear Codes. IMACC 1995: 13 - 1993
- [j3]Alexander Barg:
Incomplete Sums, DC-Constrained Codes, and Codes that Maintain Synchronization. Des. Codes Cryptogr. 3(2): 105-116 (1993) - 1992
- [j2]Alexander Barg, Ilya Dumer:
On computing the weight spectrum of cyclic codes. IEEE Trans. Inf. Theory 38(4): 1382-1386 (1992) - 1991
- [j1]Alexander Barg, Simon Litsyn:
DC-constrained codes from Hadamard matrices. IEEE Trans. Inf. Theory 37(3): 801-807 (1991) - [c1]Alexander Barg:
Exponential Sums and Constrained Error-Correcting Codes. Algebraic Coding 1991: 16-22
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-09 23:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
