default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItzhak Tamo
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Eitan Goldberg, Chong Shangguan
, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. J. Comb. Theory A 203: 105835 (2024)- [j38]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53(2): 389-430 (2024) - [j37]Roni Con, Amir Shpilka, Itzhak Tamo:
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 70(7): 5012-5016 (2024) - [c40]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Non-Binary Covering Codes for Low-Access Computations. ISIT 2024: 2772-2777 - [c39]Itzhak Tamo:
Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes. ISIT 2024: 3558-3563 - [c38]Amit Berman, Yaron Shany, Itzhak Tamo:
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. ISIT 2024: 3564-3569 - [i56]Amit Berman, Yaron Shany, Itzhak Tamo:
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. CoRR abs/2401.15034 (2024) - [i55]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. CoRR abs/2402.02358 (2024) - [i54]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Non-Binary Covering Codes for Low-Access Computations. CoRR abs/2405.05845 (2024) - [i53]Xiangliang Kong, Itzhak Tamo, Hengjia Wei:
Combinatorial alphabet-dependent bounds for insdel codes. CoRR abs/2408.10961 (2024) - [i52]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
ε-MSR Codes for Any Set of Helper Nodes. CoRR abs/2408.16584 (2024) - 2023
- [j36]Chong Shangguan, Itzhak Tamo:
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. SIAM J. Comput. 52(3): 684-717 (2023) - [j35]Bar Sadeh, Yujie Gu, Itzhak Tamo:
Bounds on the Capacity of Private Information Retrieval Over Graphs. IEEE Trans. Inf. Forensics Secur. 18: 261-273 (2023) - [j34]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. IEEE Trans. Inf. Theory 69(4): 2261-2268 (2023) - [j33]Roni Con, Amir Shpilka, Itzhak Tamo:
Reed Solomon Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 69(5): 2991-3000 (2023) - [c37]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Coefficient Complexity in Low-Access Quantized Linear Computations. Allerton 2023: 1-8 - [c36]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. ISIT 2023: 1330-1335 - [c35]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Access-Redundancy Tradeoffs in Quantized Linear Computations. ISIT 2023: 1967-1972 - [i51]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Access-Redundancy Tradeoffs in Quantized Linear Computations. CoRR abs/2305.06101 (2023) - [i50]Amit Berman, Yaron Shany, Itzhak Tamo:
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes. CoRR abs/2305.17764 (2023) - [i49]Roni Con, Amir Shpilka, Itzhak Tamo:
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. CoRR abs/2311.02771 (2023) - [i48]Itzhak Tamo:
Points-Polynomials Incidence Theorem with Applications to Coding Theory. CoRR abs/2312.12962 (2023) - [i47]Itzhak Tamo:
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/2312.17097 (2023) - 2022
- [j32]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. Des. Codes Cryptogr. 90(4): 939-945 (2022) - [j31]Roni Con, Itzhak Tamo:
Nonlinear Repair of Reed-Solomon Codes. IEEE Trans. Inf. Theory 68(8): 5165-5177 (2022) - [j30]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. IEEE Trans. Inf. Theory 68(10): 6505-6515 (2022) - [j29]Roni Con, Amir Shpilka, Itzhak Tamo:
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 68(10): 6516-6526 (2022) - [c34]Roni Con, Itzhak Tamo:
Nonlinear Repair Schemes of Reed-Solomon Codes. ITCS 2022: 50:1-50:1 - [c33]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. ISIT 2022: 2565-2570 - [c32]Roni Con, Amir Shpilka, Itzhak Tamo:
Reed Solomon Codes Against Adversarial Insertions and Deletions. ISIT 2022: 2940-2945 - [i46]Roni Con, Amir Shpilka, Itzhak Tamo:
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions. CoRR abs/2201.06130 (2022) - 2021
- [c31]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS 2021: 708-719 - [c30]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. ISIT 2021: 867-871 - [c29]Bar Sadeh, Yujie Gu, Itzhak Tamo:
Bounds on the Capacity of PIR over Graphs. ISIT 2021: 1913-1918 - [c28]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. Public Key Cryptography (1) 2021: 242-265 - [i45]Roni Con, Itzhak Tamo:
Nonlinear Repair Schemes of Reed-Solomon Codes. CoRR abs/2104.01652 (2021) - [i44]Bar Sadeh, Yujie Gu, Itzhak Tamo:
Bounds on the Capacity of PIR over Graphs. CoRR abs/2105.07704 (2021) - [i43]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. CoRR abs/2105.14754 (2021) - [i42]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. CoRR abs/2106.07785 (2021) - [i41]Roni Con, Amir Shpilka, Itzhak Tamo:
Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions. CoRR abs/2107.05699 (2021) - [i40]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. CoRR abs/2108.08679 (2021) - [i39]Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. CoRR abs/2112.05592 (2021) - [i38]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. IACR Cryptol. ePrint Arch. 2021: 254 (2021) - 2020
- [j28]Chong Shangguan, Itzhak Tamo:
Degenerate Turán densities of sparse hypergraphs. J. Comb. Theory A 173: 105228 (2020) - [j27]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. J. Comb. Theory B 144: 119-149 (2020) - [j26]Chong Shangguan, Itzhak Tamo:
Sparse Hypergraphs with Applications to Coding Theory. SIAM J. Discret. Math. 34(3): 1493-1504 (2020) - [j25]Chong Shangguan, Itzhak Tamo:
New Turán Exponents for Two Extremal Hypergraph Problems. SIAM J. Discret. Math. 34(4): 2338-2345 (2020) - [j24]Itzhak Tamo, Min Ye, Alexander Barg:
Error Correction Based on Partial Information. IEEE Trans. Inf. Theory 66(3): 1396-1404 (2020) - [j23]Netanel Raviv, Itzhak Tamo, Eitan Yaakobi:
Private Information Retrieval in Graph-Based Replication Systems. IEEE Trans. Inf. Theory 66(6): 3590-3602 (2020) - [j22]Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis:
Gradient Coding From Cyclic MDS Codes and Expander Graphs. IEEE Trans. Inf. Theory 66(12): 7475-7489 (2020) - [j21]Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo:
Minimum Guesswork With an Unreliable Oracle. IEEE Trans. Inf. Theory 66(12): 7528-7538 (2020) - [j20]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) - [c27]Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. ISIT 2020: 96-101 - [c26]Chong Shangguan, Itzhak Tamo:
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. STOC 2020: 538-551 - [i37]Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. CoRR abs/2004.01654 (2020) - [i36]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR abs/2011.04453 (2020) - [i35]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. CoRR abs/2012.11166 (2020) - [i34]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j19]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) - [c25]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The Hat Guessing Number of Graphs. ISIT 2019: 490-494 - [c24]Chong Shangguan, Itzhak Tamo:
Universally Sparse Hypergraphs with Applications to Coding Theory. ISIT 2019: 2349-2353 - [i33]Chong Shangguan, Itzhak Tamo:
Universally Sparse Hypergraphs with Applications to Coding Theory. CoRR abs/1902.05903 (2019) - [i32]Chong Shangguan, Itzhak Tamo:
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. CoRR abs/1911.01502 (2019) - 2018
- [j18]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A Bound on the Shannon Capacity via a Linear Programming Variation. SIAM J. Discret. Math. 32(3): 2229-2241 (2018) - [j17]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) - [j16]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) - [j15]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon Spaces With Applications to Coding. IEEE Trans. Inf. Theory 64(6): 4412-4422 (2018) - [j14]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. IEEE Trans. Inf. Theory 64(10): 6506-6525 (2018) - [c23]Netanel Raviv, Rashish Tandon, Alex Dimakis, Itzhak Tamo:
Gradient Coding from Cyclic MDS Codes and Expander Graphs. ICML 2018: 4302-4310 - [c22]Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo:
Minimum Guesswork with an Unreliable Oracle. ISIT 2018: 986-990 - [c21]Netanel Raviv, Itzhak Tamo:
Private Information Retrieval is Graph Based Replication Systems. ISIT 2018: 1739-1743 - [c20]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 - [i31]Oleg Kolosov, Alexander Barg, Itzhak Tamo, Gala Yadgar:
Optimal LRC codes for all lenghts n≤q. CoRR abs/1802.00157 (2018) - [i30]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A Bound on the Shannon Capacity via a Linear Programming Variation. CoRR abs/1804.05529 (2018) - [i29]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) - [i28]Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo:
Minimum Guesswork with an Unreliable Oracle. CoRR abs/1811.08528 (2018) - [i27]Netanel Raviv, Itzhak Tamo, Eitan Yaakobi:
Private Information Retrieval in Graph Based Replication Systems. CoRR abs/1812.01566 (2018) - [i26]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. CoRR abs/1812.09752 (2018) - 2017
- [j13]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Optimal Rebuilding of Multiple Erasures in MDS Codes. IEEE Trans. Inf. Theory 63(2): 1084-1101 (2017) - [j12]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally Recoverable Codes on Algebraic Curves. IEEE Trans. Inf. Theory 63(8): 4928-4939 (2017) - [c19]Itzhak Tamo, Min Ye, Alexander Barg:
Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. FOCS 2017: 216-227 - [c18]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 - [c17]Netanel Raviv, Itzhak Tamo:
Cyclic subspace codes and sidon spaces. ISIT 2017: 784-788 - [c16]Itzhak Tamo, Min Ye, Alexander Barg:
Fractional decoding: Error correction from partial information. ISIT 2017: 998-1002 - [c15]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A bound on the shannon capacity via a linear programming variation. ISIT 2017: 1063-1066 - [c14]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
∊-MSR codes with small sub-packetization. ISIT 2017: 2043-2047 - [i25]Itzhak Tamo, Min Ye, Alexander Barg:
Fractional decoding: Error correction from partial information. CoRR abs/1701.06969 (2017) - [i24]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. CoRR abs/1702.02685 (2017) - [i23]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) - [i22]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon spaces with applications to coding. CoRR abs/1705.04560 (2017) - [i21]Itzhak Tamo, Min Ye, Alexander Barg:
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound. CoRR abs/1706.00112 (2017) - [i20]Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis:
Gradient Coding from Cyclic MDS Codes and Expander Graphs. CoRR abs/1707.03858 (2017) - [i19]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth. CoRR abs/1709.08216 (2017) - 2016
- [j11]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) - [j10]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. IEEE Trans. Inf. Theory 62(6): 3070-3083 (2016) - [j9]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Explicit Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 62(8): 4466-4480 (2016) - [j8]Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Optimal Locally Repairable Codes and Connections to Matroid Theory. IEEE Trans. Inf. Theory 62(12): 6661-6671 (2016) - [c13]Sihuang Hu, Itzhak Tamo, Alexander Barg:
Combinatorial and LP bounds for LRC codes. ISIT 2016: 1008-1012 - [i18]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Optimal Rebuilding of Multiple Erasures in MDS Codes. CoRR abs/1603.01213 (2016) - [i17]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. CoRR abs/1603.08876 (2016) - [i16]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) - 2015
- [c12]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. ISIT 2015: 1252-1256 - [c11]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC codes and their subfield subcodes. ISIT 2015: 1262-1266 - [i15]Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. CoRR abs/1501.04904 (2015) - [i14]Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC Codes and their Subfield Subcodes. CoRR abs/1502.01414 (2015) - [i13]Itzhak Tamo, Alexander Barg, Alexey A. Frolov:
Bounds on the Parameters of Locally Recoverable Codes. CoRR abs/1506.07196 (2015) - 2014
- [j7]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Access Versus Bandwidth in Codes for Storage. IEEE Trans. Inf. Theory 60(4): 2028-2037 (2014) - [j6]Sreechakra Goparaju, Itzhak Tamo, A. Robert Calderbank:
An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 60(5): 2770-2779 (2014) - [j5]Itzhak Tamo, Alexander Barg:
A Family of Optimal Locally Recoverable Codes. IEEE Trans. Inf. Theory 60(8): 4661-4676 (2014) - [c10]Itzhak Tamo, Alexander Barg:
A family of optimal locally recoverable codes. ISIT 2014: 686-690 - [c9]Itzhak Tamo, Alexander Barg:
Bounds on locally recoverable codes with multiple recovering sets. ISIT 2014: 691-695 - [i12]Itzhak Tamo, Alexander Barg:
Bounds on Locally Recoverable Codes with Multiple Recovering Sets. CoRR abs/1402.0916 (2014) - [i11]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Explicit MDS Codes for Optimal Repair Bandwidth. CoRR abs/1411.6328 (2014) - 2013
- [j4]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Zigzag Codes: MDS Array Codes With Optimal Rebuilding. IEEE Trans. Inf. Theory 59(3): 1597-1616 (2013) - [c8]Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Optimal locally repairable codes and connections to matroid theory. ISIT 2013: 1814-1818 - [i10]Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Optimal Locally Repairable Codes and Connections to Matroid Theory. CoRR abs/1301.7693 (2013) - [i9]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Access vs. Bandwidth in Codes for Storage. CoRR abs/1303.3668 (2013) - [i8]Sreechakra Goparaju, Itzhak Tamo, A. Robert Calderbank:
An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes. CoRR abs/1305.3498 (2013) - [i7]Itzhak Tamo, Alexander Barg:
A family of optimal locally recoverable codes. CoRR abs/1311.3284 (2013) - 2012
- [j3]Itzhak Tamo, Moshe Schwartz:
On the Labeling Problem of Permutation Group Codes Under the Infinity Metric. IEEE Trans. Inf. Theory 58(10): 6595-6604 (2012) - [c7]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Long MDS codes for optimal repair bandwidth. ISIT 2012: 1182-1186 - [c6]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Access vs. bandwidth in codes for storage. ISIT 2012: 1187-1191 - 2011
- [j2]Moshe Schwartz, Itzhak Tamo:
Optimal permutation anticodes with the infinity norm via permanents of (0, 1)-matrices. J. Comb. Theory A 118(6): 1761-1774 (2011) - [c5]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
On codes for optimal rebuilding access. Allerton 2011: 1374-1381 - [c4]Itzhak Tamo, Moshe Schwartz:
On the labeling problem of permutation group codes under the infinity metric. ISIT 2011: 879-883 - [c3]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
MDS array codes with optimal rebuilding. ISIT 2011: 1240-1244 - [c2]Itzhak Tamo, Moshe Schwartz:
On optimal anticodes over permutations with the infinity norm. ITA 2011: 367 - [i6]Itzhak Tamo, Moshe Schwartz:
On the Labeling Problem of Permutation Group Codes under the Infinity Metric. CoRR abs/1102.2702 (2011) - [i5]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
MDS Array Codes with Optimal Rebuilding. CoRR abs/1103.3737 (2011) - [i4]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
On Codes for Optimal Rebuilding Access. CoRR abs/1107.1627 (2011) - [i3]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Zigzag Codes: MDS Array Codes with Optimal Rebuilding. CoRR abs/1112.0371 (2011) - 2010
- [j1]Itzhak Tamo, Moshe Schwartz:
Correcting limited-magnitude errors in the rank-modulation scheme. IEEE Trans. Inf. Theory 56(6): 2551-2560 (2010) - [c1]Itzhak Tamo, Moshe Schwartz:
Correcting limited-magnitude errors in the rank-modulation scheme. ITA 2010: 426-427 - [i2]Itzhak Tamo, Moshe Schwartz:
On the Size of Optimal Anticodes over Permutations with the Infinity Norm. CoRR abs/1004.1938 (2010)
2000 – 2009
- 2009
- [i1]Itzhak Tamo, Moshe Schwartz:
Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme. CoRR abs/0907.3387 (2009)
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-10-12 23:00 CEST 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:
