Остановите войну!
for scientists:
default search action
Netanel Raviv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
- [b1]Netanel Raviv:
Subspace codes and distributed storage codes. Technion - Israel Institute of Technology, Israel, 2017
Journal Articles
- 2022
- [j17]Canran Wang, Netanel Raviv:
Breaking Blockchain's Communication Barrier With Coded Computation. IEEE J. Sel. Areas Inf. Theory 3(2): 405-421 (2022) - 2021
- [j16]Jin Sima, Netanel Raviv, Jehoshua Bruck:
On Coding Over Sliced Information. IEEE Trans. Inf. Theory 67(5): 2793-2807 (2021) - 2020
- [j15]Netanel Raviv, Moshe Schwartz, Rami Cohen, Yuval Cassuto:
Hierarchical erasure correction of linear codes. Finite Fields Their Appl. 68: 101743 (2020) - [j14]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation From Lagrange Encoding. IEEE Trans. Inf. Forensics Secur. 15: 553-563 (2020) - [j13]Jin Sima, Netanel Raviv, Jehoshua Bruck:
Two Deletion Correcting Codes From Indicator Vectors. IEEE Trans. Inf. Theory 66(4): 2375-2391 (2020) - [j12]Netanel Raviv, Itzhak Tamo, Eitan Yaakobi:
Private Information Retrieval in Graph-Based Replication Systems. IEEE Trans. Inf. Theory 66(6): 3590-3602 (2020) - [j11]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) - 2019
- [j10]Netanel Raviv, Moshe Schwartz, Eitan Yaakobi:
Rank-Modulation Codes for DNA Storage With Shotgun Sequencing. IEEE Trans. Inf. Theory 65(1): 50-64 (2019) - [j9]Rami Cohen, Netanel Raviv, Yuval Cassuto:
LDPC Codes Over the q-ary Multi-Bit Channel. IEEE Trans. Inf. Theory 65(7): 4293-4306 (2019) - 2018
- [j8]Netanel Raviv, Eitan Yaakobi, Muriel Médard:
Coding for locality in reconstructing permutations. Des. Codes Cryptogr. 86(2): 387-418 (2018) - [j7]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon Spaces With Applications to Coding. IEEE Trans. Inf. Theory 64(6): 4412-4422 (2018) - [j6]Netanel Raviv:
Asymptotically Optimal Regenerating Codes Over Any Field. IEEE Trans. Inf. Theory 64(11): 7178-7187 (2018) - 2017
- [j5]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields. IEEE Trans. Inf. Theory 63(4): 2015-2038 (2017) - [j4]Netanel Raviv, Antonia Wachter-Zeh:
A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius". IEEE Trans. Inf. Theory 63(4): 2623-2624 (2017) - 2016
- [j3]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory 62(3): 1157-1165 (2016) - [j2]Netanel Raviv, Antonia Wachter-Zeh:
Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius. IEEE Trans. Inf. Theory 62(4): 1605-1615 (2016) - 2015
- [j1]Tuvi Etzion, Netanel Raviv:
Equidistant codes in the Grassmannian. Discret. Appl. Math. 186: 87-97 (2015)
Conference and Workshop Papers
- 2023
- [c38]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Coefficient Complexity in Low-Access Quantized Linear Computations. Allerton 2023: 1-8 - [c37]Netanel Raviv, Canran Wang, Jin Sima, Vinh Pham, Mi Zhou:
Coding for Forensic 3D Fingerprinting. Allerton 2023: 1 - [c36]Ben Langton, Netanel Raviv:
A Generalized Covering Algorithm for Chained Codes. ISIT 2023: 844-849 - [c35]Zirui Deng, Netanel Raviv:
Approximate Private Inference in Quantized Models. ISIT 2023: 1597-1602 - [c34]Ilan Tennenhouse, Netanel Raviv:
Transaction Confirmation in Coded Blockchain. ISIT 2023: 1735-1740 - [c33]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Access-Redundancy Tradeoffs in Quantized Linear Computations. ISIT 2023: 1967-1972 - 2022
- [c32]Netanel Raviv, Rawad Bitar, Eitan Yaakobi:
Information Theoretic Private Inference in Quantized Models. ISIT 2022: 1641-1646 - [c31]Netanel Raviv, Ziv Goldfeld:
Perfect Subset Privacy for Data Sharing and Learning. ISIT 2022: 1850-1855 - [c30]Xiangwu Zuo, Anxiao Andrew Jiang, Netanel Raviv, Paul H. Siegel:
Symbolic Regression for Data Storage with Side Information. ITW 2022: 208-213 - [c29]Canran Wang, Netanel Raviv:
All-to-All Encode in Synchronous Systems. ITW 2022: 738-743 - [c28]Canran Wang, Netanel Raviv:
Breaking Blockchain's Communication Barrier with Coded Computation. ITW 2022: 744-749 - 2021
- [c27]Netanel Raviv, Aidan Kelley, Minzhe Guo, Yevgeniy Vorobeychik:
Enhancing Robustness of Neural Networks through Fourier Stabilization. ICML 2021: 8880-8889 - [c26]Canran Wang, Netanel Raviv:
Low Latency Cross-Shard Transactions in Coded Blockchain. ISIT 2021: 2678-2683 - [c25]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. Public Key Cryptography (1) 2021: 242-265 - 2020
- [c24]Hikmet Yildiz, Netanel Raviv, Babak Hassibi:
Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero. ISIT 2020: 60-65 - [c23]Jin Sima, Netanel Raviv, Jehoshua Bruck:
Robust Indexing - Optimal Codes for DNA Storage. ISIT 2020: 717-722 - [c22]Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Andrew Jiang:
CodNN - Robust Neural Networks From Coded Classification. ISIT 2020: 2688-2693 - [c21]Netanel Raviv, Siddharth Jain, Jehoshua Bruck:
What is the Value of Data? on Mathematical Methods for Data Quality Estimation. ISIT 2020: 2825-2830 - [c20]Kunping Huang, Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Paul H. Siegel, Anxiao Andrew Jiang:
Improve Robustness of Deep Neural Networks by Coding. ITA 2020: 1-7 - [c19]Netanel Raviv:
Robust Neural Computation From Error Correcting Codes : An Invited Paper. ITW 2020: 1-5 - 2019
- [c18]Qian Yu, Songze Li, Netanel Raviv, Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr:
Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy. AISTATS 2019: 1215-1225 - [c17]Jin Sima, Netanel Raviv, Jehoshua Bruck:
On Coding Over Sliced Information. ISIT 2019: 767-771 - [c16]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation from Lagrange Encoding. ISIT 2019: 1672-1676 - [c15]Netanel Raviv, Qian Yu, Jehoshua Bruck, Salman Avestimehr:
Download and Access Trade-offs in Lagrange Coded Computing. ISIT 2019: 1787-1791 - 2018
- [c14]Netanel Raviv, Rashish Tandon, Alex Dimakis, Itzhak Tamo:
Gradient Coding from Cyclic MDS Codes and Expander Graphs. ICML 2018: 4302-4310 - [c13]Jin Sima, Netanel Raviv, Jehoshua Bruck:
Two Deletion Correcting Codes from Indicator Vectors. ISIT 2018: 421-425 - [c12]Netanel Raviv, Itzhak Tamo:
Private Information Retrieval is Graph Based Replication Systems. ISIT 2018: 1739-1743 - [c11]Netanel Raviv, Yuval Cassuto, Rami Cohen, Moshe Schwartz:
Erasure Correction of Scalar Codes in the Presence of Stragglers. ISIT 2018: 1983-1987 - [c10]Siddharth Jain, Netanel Raviv, Jehoshua Bruck:
Attaining the 2nd Chargaff Rule by Tandem Duplications. ISIT 2018: 2241-2245 - [c9]Qian Yu, Netanel Raviv, Amir Salman Avestimehr:
Coding for Private and Secure Multiparty Computing. ITW 2018: 1-5 - 2017
- [c8]Netanel Raviv, Itzhak Tamo:
Cyclic subspace codes and sidon spaces. ISIT 2017: 784-788 - [c7]Netanel Raviv:
Asymptotically optimal regenerating codes over any field. ISIT 2017: 1416-1420 - [c6]Netanel Raviv, Moshe Schwartz, Eitan Yaakobi:
Rank modulation codes for DNA storage. ISIT 2017: 3125-3129 - 2016
- [c5]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Constructions of high-rate minimum storage regenerating codes over small fields. ISIT 2016: 61-65 - [c4]Netanel Raviv, Eitan Yaakobi, Muriel Médard:
Coding for locality in reconstructing permutations. ISIT 2016: 450-454 - 2015
- [c3]Netanel Raviv, Antonia Wachter-Zeh:
Some Gabidulin codes cannot be list decoded efficiently at any radius. ISIT 2015: 6-10 - [c2]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace polynomials and cyclic subspace codes. ISIT 2015: 586-590 - [c1]Netanel Raviv, Tuvi Etzion:
Distributed storage systems based on intersecting subspace codes. ISIT 2015: 1462-1466
Informal and Other Publications
- 2024
- [i40]Aobo Lyu, Andrew Clark, Netanel Raviv:
Explicit Formula for Partial Information Decomposition. CoRR abs/2402.03554 (2024) - [i39]Netanel Raviv:
Linear Codes for Hyperdimensional Computing. CoRR abs/2403.03278 (2024) - [i38]Canran Wang, Jinwen Wang, Mi Zhou, Vinh Pham, Senyue Hao, Chao Zhou, Ning Zhang, Netanel Raviv:
Secure Information Embedding and Extraction in Forensic 3D Fingerprinting. CoRR abs/2403.04918 (2024) - [i37]Zirui Deng, Vinayak Ramkumar, Netanel Raviv:
Perfect Subset Privacy in Polynomial Computation. CoRR abs/2405.05567 (2024) - [i36]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Non-Binary Covering Codes for Low-Access Computations. CoRR abs/2405.05845 (2024) - 2023
- [i35]Zirui Deng, Netanel Raviv:
Approximate Private Inference in Quantized Models. CoRR abs/2305.03801 (2023) - [i34]Ben Langton, Netanel Raviv:
A Generalized Covering Algorithm for Chained Codes. CoRR abs/2305.05157 (2023) - [i33]Ilan Tennenhouse, Netanel Raviv:
Transaction Confirmation in Coded Blockchain. CoRR abs/2305.05977 (2023) - [i32]Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Access-Redundancy Tradeoffs in Quantized Linear Computations. CoRR abs/2305.06101 (2023) - [i31]Jin Sima, Netanel Raviv, Jehoshua Bruck:
Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions. CoRR abs/2308.07793 (2023) - [i30]Jin Sima, Netanel Raviv, Moshe Schwartz, Jehoshua Bruck:
Error Correction for DNA Storage. CoRR abs/2310.01729 (2023) - [i29]Canran Wang, Jin Sima, Netanel Raviv:
Break-Resilient Codes for Forensic 3D Fingerprinting. CoRR abs/2310.03897 (2023) - [i28]Bahram Yaghooti, Netanel Raviv, Bruno Sinopoli:
Beyond PCA: A Probabilistic Gram-Schmidt Approach to Feature Extraction. CoRR abs/2311.09386 (2023) - [i27]Zirui Deng, Vinayak Ramkumar, Rawad Bitar, Netanel Raviv:
Private Inference in Quantized Models. CoRR abs/2311.13686 (2023) - 2022
- [i26]Canran Wang, Netanel Raviv:
Breaking Blockchain's Communication Barrier with Coded Computation. CoRR abs/2204.00979 (2022) - [i25]Canran Wang, Netanel Raviv:
All-to-All Encode in Synchronous Systems. CoRR abs/2205.05183 (2022) - 2021
- [i24]Netanel Raviv, Aidan Kelley, Michael Guo, Yevgeniy Vorobeychik:
Enhancing Robustness of Neural Networks through Fourier Stabilization. CoRR abs/2106.04435 (2021) - [i23]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. CoRR abs/2106.07785 (2021) - [i22]Netanel Raviv, Ben Langton, Itzhak Tamo:
Multivariate Public Key Cryptosystem from Sidon Spaces. IACR Cryptol. ePrint Arch. 2021: 254 (2021) - 2020
- [i21]Netanel Raviv, Siddharth Jain, Jehoshua Bruck:
What is the Value of Data? On Mathematical Methods for Data Quality Estimation. CoRR abs/2001.03464 (2020) - [i20]Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Jiang:
CodNN - Robust Neural Networks From Coded Classification. CoRR abs/2004.10700 (2020) - [i19]Hikmet Yildiz, Netanel Raviv, Babak Hassibi:
Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero. CoRR abs/2004.14430 (2020) - [i18]Canran Wang, Netanel Raviv:
Low Latency Cross-Shard Transactions in Coded Blockchain. CoRR abs/2011.00087 (2020) - 2018
- [i17]Netanel Raviv, Yuval Cassuto, Rami Cohen, Moshe Schwartz:
Erasure correction of scalar codes in the presence of stragglers. CoRR abs/1802.02265 (2018) - [i16]Qian Yu, Netanel Raviv, Jinhyun So, Amir Salman Avestimehr:
Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy. CoRR abs/1806.00939 (2018) - [i15]Jin Sima, Netanel Raviv, Jehoshua Bruck:
Two Deletion Correcting Codes from Indicator Vectors. CoRR abs/1806.09240 (2018) - [i14]Jin Sima, Netanel Raviv, Jehoshua Bruck:
On Coding over Sliced Information. CoRR abs/1809.02716 (2018) - [i13]Netanel Raviv, Itzhak Tamo, Eitan Yaakobi:
Private Information Retrieval in Graph Based Replication Systems. CoRR abs/1812.01566 (2018) - [i12]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation from Lagrange Encoding. CoRR abs/1812.04142 (2018) - 2017
- [i11]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon spaces with applications to coding. CoRR abs/1705.04560 (2017) - [i10]Rami Cohen, Netanel Raviv, Yuval Cassuto:
LDPC Codes over the q-ary Multi-Bit Channel. CoRR abs/1706.09146 (2017) - [i9]Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis:
Gradient Coding from Cyclic MDS Codes and Expander Graphs. CoRR abs/1707.03858 (2017) - [i8]Netanel Raviv, Moshe Schwartz, Eitan Yaakobi:
Rank modulation codes for DNA storage. CoRR abs/1708.02146 (2017) - 2016
- [i7]Netanel Raviv, Eitan Yaakobi, Muriel Médard:
Coding for Locality in Reconstructing Permutations. CoRR abs/1601.04504 (2016) - [i6]Netanel Raviv:
Asymptotically Optimal Regenerating Codes Over Any Field. CoRR abs/1609.06420 (2016) - 2015
- [i5]Netanel Raviv, Antonia Wachter-Zeh:
Some Gabidulin Codes cannot be List Decoded Efficiently at any Radius. CoRR abs/1501.04272 (2015) - [i4]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Access-optimal MSR Codes with Optimal Sub-packetization over Small Fields. CoRR abs/1505.00919 (2015) - 2014
- [i3]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. CoRR abs/1404.7739 (2014) - [i2]Netanel Raviv, Tuvi Etzion:
Distributed Storage Systems based on Equidistant Subspace Codes. CoRR abs/1406.6170 (2014) - 2013
- [i1]Netanel Raviv:
Truth Table Minimization of Computational Models. CoRR abs/1306.3766 (2013)
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-07-09 04:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint