Publications

Journal Publications

Chong Shangguan, and Itzhak Tamo
“Universally Sparse Hypergraphs with Applications to Coding Theory”.
Submitted.

Natan Ardimanov, Ofer Shayevitz, and Itzhak Tamo
“Minimum Guesswork with an Unreliable Oracle”.
Submitted.

Noga Alon, Omri Ben-Eliezer, Chong Shangguan, and Itzhak Tamo
“The hat guessing number of graphs”.
Submitted.

Netanel Raviv, Itzhak Tamo, Rashish Tandon, and Alexandros G. Dimakis
“Gradient Coding from Cyclic MDS Codes and Expander Graphs”.
Submitted.

Netanel Raviv, Itzhak Tamo, and Eitan Yaakobi,
“Private Information Retrieval in Graph Based Replication Systems”.
Submitted.

Itzhak Tamo, Min Ye, and Alexander Barg
“Error correction based on partial information”.
Submitted.

Itzhak Tamo, Min Ye, and Alexander Barg,
“The Repair Problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal nodes size”.
IEEE Trans. On Inform. Theory (2018).

Sihuang Hu, Itzhak Tamo, and Ofer Shayevitz
“A Bound on the Shannon Capacity via a Linear Programming Variation”.
SIAM Journal on Discrete Mathematics, vol. 32, no.3, pp. 2229-2241.

M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, and Alexander Barg
“Exploiting Locality for Improved Decoding of Binary Cyclic Codes”.
IEEE Trans. On Communications., vol. 66, no.6, pp. 2346 - 2358, June 2018.

Ankit S. Rawat, Itzhak Tamo, Venkatesan Guruswami, and Klim Efremenko
“MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth Codes”.
IEEE Trans. On Inform. Theory., vol. 64, no.10, pp. 6506 - 6525, October 2018.

Ron M. Roth, Netanel Raviv, and Itzhak Tamo
“Construction of Sidon spaces with applications to coding”.
IEEE Trans. On Inform. Theory., vol. 64, no.6,pp. 4412-4422, June 2018.

Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, and Itzhak Tamo
“Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes”.
IEEE Trans. On Inform. Theory., vol. 64, no.5, pp. 3481-3492, May 2018.

Alexander Barg, Itzhak Tamo and Serge Vladut,
“Locally Recoverable Codes on Algebraic Curves”.
IEEE Trans. On Inform. Theory., vol. 63, no.8, pp. 4928 - 4939, August 2017.

Zhiying Wang, Itzhak Tamo, and Jehoshua Bruck,
“Optimal Rebuilding of Multiple Erasures in MDS Codes”.
IEEE Trans. On Inform. Theory., vol. 63, no.2, pp. 1084-1101, February 2017.

Itzhak Tamo, Dimitris S. Papailiopoulos, and Alexandros G. Dimakis,
“Optimal Locally Repairable Codes and Connections to Matroid Theory”.
IEEE Trans. On Inform. Theory., vol. 62, no.12, pp. 6661-6671, December 2016.

Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, and Robert Calderbank,
“Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes”.
Int. J. of Information and Coding Theory., 2016 Vol.3, No.4, pp.345 - 364.

Zhiying Wang, Itzhak Tamo, and Jehoshua Bruck,
“Explicit Minimum Storage Regenerating Codes”.
IEEE Trans. On Inform. Theory., vol. 62, no.8, pp. 4466-4480, August 2016.

Itzhak Tamo, Alexander Barg, and Alexey Frolov,
“Bounds on the parameters of Locally Recoverable Codes”.
IEEE Trans. On Inform. Theory., vol. 62, no.6, pp. 3070-3083, June 2016.

Itzhak Tamo and Alexander Barg,
“A Family of Optimal Locally Recoverable Codes”.
IEEE Trans. On Inform. Theory., vol. 60, no.8, pp. 4661-4676, August 2014. 2015 IEEE Information Theory Society Paper Award.

Sreechakra Goparaju, Itzhak Tamo, and Robert Calderbank,
“An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes”.
IEEE Trans. on Inform. Theory, vol. 60, no. 5, pp. 2028-2037, pp. 2770-2779, May 2014.

Itzhak Tamo, Zhiying Wang, and Jehoshua Bruck,
“Access vs. Bandwidth in Codes for Storage”.
IEEE Trans. on Inform. Theory, vol. 60, no. 4, pp. 2028-2037, April 2014.

Itzhak Tamo, Zhiying Wang, and Jehoshua Bruck,
“Zigzag Codes: MDS Array Codes With Optimal Rebuilding”.
IEEE Trans. on Inform. Theory, vol. 59, no. 3, pp. 1597-1616, March 2013. IEEE Communication Society Data Storage Technical Committee 2013 Best Paper Award.

Itzhak Tamo and Moshe Schwartz,
“On the Labeling Problem of Permutation Group Codes under the Infinity Metric”.
IEEE Trans. on Inform. Theory, vol. 58, no. 10, pp. 6595-6604, October 2012.

Moshe Schwartz and Itzhak Tamo,
“Optimal permutation anticodes with the infinity norm via permanents of (0, 1) matrices”.
Journal of Combinatorial Theory Series A, Volume 118, pp. 1761-1774, August 2011.

Itzhak Tamo and Moshe Schwartz,
“Correcting Limited-Magnitude Errors in the Rank- Modulation Scheme”.
IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2551-2560, June 2010.

Conference Publications

Chong Shangguan, and Itzhak Tamo
“Universally Sparse Hypergraphs with Applications to Coding Theory”.
Accepted to the 2019 IEEE International Symposium on Information Theory, Paris, France, July 2019.

Noga Alon, Omri Ben-Eliezer, Chong Shangguan, and Itzhak Tamo
“The hat guessing number of graphs”.
Accepted to the 2019 IEEE International Symposium on Information Theory, Paris, France, July 2019.

Netanel Raviv, Rashish Tandon, Alexandros G. Dimakis, and Itzhak Tamo
“Gradient Coding from Cyclic MDS Codes and Expander Graphs”.
Thirty-fifth International Conference on Machine Learning (ICML) 2018, Stockholm, Sweden, July 2018.

Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, and Alexander Barg
“On Fault Tolerance, Locality, and Optimality of Locally Repairable Codes”.
2018 USENIX Annual Technical Conference, July 2018, Boston, MA, USA.

Natan Ardimanov, Ofer Shayevitz, and Itzhak Tamo,
“Minimum Guesswork with an Unreliable Oracle”.
In Proceedings of the 2018 IEEE International Symposium on Information Theory, Vail, Colorado, USA, June 2018.

Netanel Raviv, and Itzhak Tamo,
“Private Information Retrieval in Graph Based Replication Systems”.
In Proceedings of the 2018 IEEE International Symposium on Information Theory, Vail, Colorado, USA, June 2018.

Itzhak Tamo, Min Ye, and Alexander Barg
“Optimal repair of Reed-Solomon codes: Achieving the cut set bound”.
FOCS 2017, 58th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, Ca, USA, October 2017.

Ankit S. Rawat, Itzhak Tamo, Venkatesan Guruswami, and Klim Efremenko,
“ Epsilon-MSR Codes with small sub-packetization”.
In Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

Sihuang Hu, Itzhak Tamo, and Ofer Shayevitz,
“A Bound on the Shannon Capacity via a Linear Programming Variation”.
In Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

Itzhak Tamo, Min Ye, and Alexander Barg,
“Fractional Decoding: Error Correction from Partial Information”.
In Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

Netanel Raviv, and Itzhak Tamo,
“Cyclic Subspace Codes and Sidon Spaces”.
In Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, and Alexander Barg
“A study on the impact of Locality in the Decoding of Binary Cyclic Codes”.
In Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

Sihuang Hu, Itzhak Tamo, and Alexander Barg,
“ Combinatorial and LP bounds for LRC codes”.
In Proceedings of the 2016 IEEE International Symposium on Information Theory, Barcelona, Spain, July 2016.

Alexander Barg, Itzhak Tamo, and Serge Vladut
“Locally Recoverable Codes on Algebraic Curves”.
In Proceedings of the 2015 IEEE International Symposium on Information Theory, Hong Kong, June 2015.

Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, and Robert Calderbank,
“Cyclic LRC Codes and their Subfield Subcodes”.
In Proceedings of the 2015 IEEE International Symposium on Information Theory, Hong Kong, June 2015.

Itzhak Tamo and Alexander Barg
“A Family of Optimal Locally Recoverable Codes”.
In Proceedings of the 2014 IEEE International Symposium on Information Theory, Hawaii, USA , July 2014.

Itzhak Tamo and Alexander Barg
“Bounds on Locally Recoverable Codes with Multiple Recovering Sets”.
In Proceedings of the 2014 IEEE International Symposium on Information Theory, Hawaii, USA, July 2014.

Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis,
“Optimal Locally Repairable Codes and Connections to Matroid Theory”.
In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013.

Itzhak Tamo, Zhiying Wang, and Jehoshua Bruck,
“Access vs. Bandwidth in Codes for Storage”.
In Proceedings of the 2012 IEEE International Symposium on Information Theory, Cambridge, Ma, USA, July 2012.

Zhiying Wang, Itzhak Tamo, and Jehoshua Bruck,
“Long MDS Codes for Optimal Repair Bandwidth”.
In Proceedings of the 2012 IEEE International Symposium on Information Theory, Cambridge, Ma, USA, July 2012.

Zhiying Wang, Itzhak Tamo, and Jehoshua Bruck,
“On Codes for Optimal Rebuilding Access;.
In Proceedings of the 2011 Allerton Conference on Communication, Control and Computing, Illinois, U.S.A, September 2011.

Itzhak Tamo, Zhiying Wang, and Jehoshua Bruck,
“MDS Array Codes with Optimal Rebuilding”.
In Proceedings of the 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia, August 2011.

Itzhak Tamo and Moshe Schwartz,
“On the Labeling Problem of Permutation Group Codes under the Infinity Metric”.
In Proceedings of the 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia, August 2011.

Itzhak Tamo and Moshe Schwartz,
“On Optimal Anti-codes over Permutations with the Infinity Norm”.
In Proceedings of the Information Theory and Applications Workshop 2011, ITA2011, San-Diego, California, U.S.A., February 2011.

Itzhak Tamo and Moshe Schwartz,
“Correcting Limited-Magnitude Errors in the Rank- Modulation Scheme”.
In Proceedings of the Information Theory and Applications Workshop 2010, ITA2010, San-Diego, California, U.S.A., February 2010.