| A family of optimal locally recoverable codes I Tamo, A Barg IEEE Transactions on Information Theory 60 (8), 4661-4676, 2014 | 681 | 2014 |
| Minimal vectors in linear codes A Ashikhmin, A Barg IEEE Transactions on Information Theory 44 (5), 2010-2017, 2002 | 449 | 2002 |
| Digital fingerprinting codes: Problem statements, constructions, identification of traitors A Barg, GR Blakley, GA Kabatiansky IEEE Transactions on Information Theory 49 (4), 852-865, 2003 | 272 | 2003 |
| Explicit constructions of high-rate MDS array codes with optimal repair bandwidth M Ye, A Barg IEEE Transactions on Information Theory 63 (4), 2001-2014, 2017 | 269 | 2017 |
| Random codes: Minimum distances and error exponents A Barg, GD Forney IEEE Transactions on Information Theory 48 (9), 2568-2573, 2002 | 268 | 2002 |
| Bounds on packings of spheres in the Grassmann manifold A Barg, DY Nogin IEEE Transactions on Information Theory 48 (9), 2450-2454, 2002 | 263 | 2002 |
| Optimal schemes for discrete distribution estimation under locally differential privacy M Ye, A Barg IEEE Transactions on Information Theory 64 (8), 5662-5676, 2018 | 248 | 2018 |
| Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization M Ye, A Barg IEEE Transactions on Information Theory 63 (10), 6307-6317, 2017 | 219 | 2017 |
| Complexity issues in coding theory A Barg Handbook of Coding theory 1, 649-754, 1998 | 219 | 1998 |
| Codes in permutations and error correction for rank modulation A Barg, A Mazumdar 2010 IEEE International Symposium on Information Theory, 854-858, 2010 | 214 | 2010 |
| Bounds on the parameters of locally recoverable codes I Tamo, A Barg, A Frolov IEEE Transactions on information theory 62 (6), 3070-3083, 2016 | 168 | 2016 |
| Clay codes: Moulding {MDS} codes to yield an {MSR} code M Vajha, V Ramkumar, B Puranik, G Kini, E Lobo, B Sasidharan, ... 16th USENIX Conference on File and Storage Technologies (FAST 18), 139-154, 2018 | 151 | 2018 |
| Locally recoverable codes on algebraic curves A Barg, I Tamo, S Vlăduţ IEEE Transactions on Information Theory 63 (8), 4928-4939, 2017 | 136 | 2017 |
| A hypergraph approach to the identifying parent property: the case of multiple parents A Barg, G Cohen, S Encheva, G Kabatiansky, G Zémor SIAM Journal on Discrete Mathematics 14 (3), 423-431, 2001 | 128 | 2001 |
| Error exponents of expander codes A Barg, G Zémor IEEE Transactions on Information Theory 48 (6), 1725-1729, 2002 | 121 | 2002 |
| Polar Codes for Q-Ary Channels, W Park, A Barg IEEE Transactions on Information Theory 59 (2), 955-969, 2012 | 113 | 2012 |
| Secret key generation for a pairwise independent network model S Nitinawarat, C Ye, A Barg, P Narayan, A Reznik IEEE Transactions on Information Theory 56 (12), 6482-6489, 2010 | 112 | 2010 |
| Bounds on locally recoverable codes with multiple recovering sets I Tamo, A Barg 2014 IEEE International Symposium on Information Theory, 691-695, 2014 | 107 | 2014 |
| Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component TC Gulcu, A Barg IEEE Transactions on Information Theory 63 (2), 1311-1324, 2016 | 101 | 2016 |
| Cyclic LRC codes and their subfield subcodes I Tamo, A Barg, S Goparaju, R Calderbank 2015 IEEE international symposium on information theory (ISIT), 1262-1266, 2015 | 98 | 2015 |
Min YeIonQVerified email at ionq.co
