Netanel Raviv

Orcid: 0000-0002-1686-1994

According to our database1, Netanel Raviv authored at least 76 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Efficient Vector Symbolic Architectures from Histogram Recovery.
CoRR, November, 2025

The Whole Is Less than the Sum of Parts: Subsystem Inconsistency in Partial Information Decomposition.
CoRR, October, 2025

ε-MSR Codes for Any Set of Helper Nodes.
IEEE Trans. Inf. Theory, September, 2025

Efficient Static Schedules for Fault-Tolerant Transmissions on Shared Media.
IEEE Trans. Computers, September, 2025

Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures.
CoRR, August, 2025

Single Fragment Forensic Coding from Discrepancy Theory.
CoRR, August, 2025

Private Inference in Quantized Models.
IEEE Trans. Inf. Theory, May, 2025

Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions.
IEEE Trans. Inf. Theory, February, 2025

Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection.
IEEE Trans. Inf. Theory, 2025

Secure Information Embedding in Forensic 3D Fingerprinting.
Proceedings of the 34th USENIX Security Symposium, 2025

Differential Confounding Privacy and Inverse Composition.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Individual Confidential Computing of Polynomials Over Non-Uniform Information.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Single Fragment Forensic Coding from Van Der Corput Sets.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Linear Codes for Hyperdimensional Computing.
Neural Comput., 2024

On the Encoding Process in Decentralized Systems.
CoRR, 2024

Confounding Privacy and Inverse Composition.
CoRR, 2024

Secure Information Embedding and Extraction in Forensic 3D Fingerprinting.
CoRR, 2024

Break-Resilient Codes for Forensic 3D Fingerprinting.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Non-Binary Covering Codes for Low-Access Computations.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Explicit Formula for Partial Information Decomposition.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Perfect Subset Privacy in Polynomial Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Gram-Schmidt Methods for Unsupervised Feature Selection.
Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

Beyond PCA: A Gram-Schmidt Approach to Feature Extraction.
Proceedings of the 60th Annual Allerton Conference on Communication, 2024

2023
Beyond PCA: A Probabilistic Gram-Schmidt Approach to Feature Extraction.
CoRR, 2023

Error Correction for DNA Storage.
CoRR, 2023

Transaction Confirmation in Coded Blockchain.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Access-Redundancy Tradeoffs in Quantized Linear Computations.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Generalized Covering Algorithm for Chained Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Approximate Private Inference in Quantized Models.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Coding for Forensic 3D Fingerprinting.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

Coefficient Complexity in Low-Access Quantized Linear Computations.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022
Symbolic Regression for Data Storage with Side Information.
Proceedings of the IEEE Information Theory Workshop, 2022

Breaking Blockchain's Communication Barrier with Coded Computation.
Proceedings of the IEEE Information Theory Workshop, 2022

All-to-All Encode in Synchronous Systems.
Proceedings of the IEEE Information Theory Workshop, 2022

Perfect Subset Privacy for Data Sharing and Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Information Theoretic Private Inference in Quantized Models.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Enhancing Robustness of Neural Networks through Fourier Stabilization.
CoRR, 2021

Multivariate Public Key Cryptosystem from Sidon Spaces.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Low Latency Cross-Shard Transactions in Coded Blockchain.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Enhancing Robustness of Neural Networks through Fourier Stabilization.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Private Information Retrieval in Graph-Based Replication Systems.
IEEE Trans. Inf. Theory, 2020

Hierarchical erasure correction of linear codes.
Finite Fields Their Appl., 2020

Robust Neural Computation From Error Correcting Codes : An Invited Paper.
Proceedings of the IEEE Information Theory Workshop, 2020

Improve Robustness of Deep Neural Networks by Coding.
Proceedings of the Information Theory and Applications Workshop, 2020

Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Robust Indexing - Optimal Codes for DNA Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2020

CodNN - Robust Neural Networks From Coded Classification.
Proceedings of the IEEE International Symposium on Information Theory, 2020

What is the Value of Data? on Mathematical Methods for Data Quality Estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.
IEEE Trans. Inf. Theory, 2019

LDPC Codes Over the q-ary Multi-Bit Channel.
IEEE Trans. Inf. Theory, 2019

On Coding Over Sliced Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Download and Access Trade-offs in Lagrange Coded Computing.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Polynomial Computation from Lagrange Encoding.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Construction of Sidon Spaces With Applications to Coding.
IEEE Trans. Inf. Theory, 2018

Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy.
CoRR, 2018

Coding for Private and Secure Multiparty Computing.
Proceedings of the IEEE Information Theory Workshop, 2018

Two Deletion Correcting Codes from Indicator Vectors.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Private Information Retrieval is Graph Based Replication Systems.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Erasure Correction of Scalar Codes in the Presence of Stragglers.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Attaining the 2nd Chargaff Rule by Tandem Duplications.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Gradient Coding from Cyclic MDS Codes and Expander Graphs.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Subspace codes and distributed storage codes.
PhD thesis, 2017

A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius".
IEEE Trans. Inf. Theory, 2017

Cyclic subspace codes and sidon spaces.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Rank modulation codes for DNA storage.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Asymptotically optimal regenerating codes over any field.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Coding for locality in reconstructing permutations.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Constructions of high-rate minimum storage regenerating codes over small fields.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Equidistant codes in the Grassmannian.
Discret. Appl. Math., 2015

Access-optimal MSR Codes with Optimal Sub-packetization over Small Fields.
CoRR, 2015

Some Gabidulin codes cannot be list decoded efficiently at any radius.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Distributed storage systems based on intersecting subspace codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Subspace polynomials and cyclic subspace codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Distributed Storage Systems based on Equidistant Subspace Codes.
CoRR, 2014

2013
Truth Table Minimization of Computational Models.
CoRR, 2013


  Loading...