• Feb. 7th, 2025 – New journal paper:
  • Jan. 22nd, 2025 – New paper:
  • Nov. 20th, 2024 – New journal paper:
  • Aug. 30th, 2024 – New preprints:
  • Aug. 13th, 2024 – New paper:
    • B. Yaghooti, N. Raviv, and B. Sinopoli, “Beyond PCA: A Gram-Schmidt Approach to Feature Extraction,” to appear in the 60th Annual Allerton Conference on Communication, Control, and Computing, 2024.
  • July 24th, 2024 – New paper:
    • B. Yaghooti, N. Raviv, and B. Sinopoli, “Gram-Schmidt Methods for Unsupervised Feature Selection,” to appear in IEEE Conference on Decision and Control (CDC), 2024.
  • June 24th, 2024 – New paper:
  • May 13th, 2024 – New papers:
    • C. Wang, J. Sima, and N. Raviv, “Break-Resilient Codes for Forensic 3D Fingerprinting,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
    • Z. Deng, V. Ramkumar, and N. Raviv, “Perfect Subset Privacy in Polynomial Computation,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
    • V. Ramkumar, N. Raviv, and I. Tamo, “Non-binary Covering Codes for Low-Access Computations,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
    • A. Lyu, A. Clark, and N. Raviv, “Explicit Formula for Partial Information Decomposition,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
  • Apr. 9th, 2024 – I gave a talk in Munich Workshop on Coding and Cryptography,
    • N. Raviv, “New Directions in Private Computation.”
  • Mar. 12th, 2024 – New preprint:
  • March 15th, 2024 – I will give a talk about my new paper “Linear codes for hyperdimensional computing” at UC Berkeley. [link]
  • Two talks about our paper “Beyond PCA: A Probabilistic Gram-Schmidt Approach to Feature Extraction.”
    • Feb. 9th at Indiana University in Bloomington.
    • Feb. 19th-22nd at the Information Theory and Application (ITA) workshop.
  • Feb. 7th, 2024 – New preprint:
  • Feb. 5th, 2024 – New paper:
    • N. Raviv, “Linear codes for hyperdimensional computing,” to appear in Neural Computation, 2024.
  • Oct. 9th, 2023 – New magazine paper and new preprint:
  • Aug. 7th, 2023 – A paper and an invited presentation in Allerton Conference on Communication, Control, and Computing.
    • V. Ramkumar, N. Raviv, and I. Tamo, “Coefficient Complexity in Low-Access Quantized Linear Computations,” (Allerton), 2023.
    • N. Raviv, “Coding for forensic 3D fingerprinting,” (Allerton), 2023.
  • May 12th, 2023 – New papers in 2023 International Symposium on Information Theory:
    • I. Tennenhouse and N. Raviv, “Transaction Confirmation in Coded Blockchain,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
    • B. Langton and N. Raviv, “A Generalized Covering Algorithm for Chained Codes,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
    • Z. Deng and N. Raviv, “Approximate Private Inference in Quantized Models,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
    • V. Ramkumar, N. Raviv, and I. Tamo, “Access-Redundancy Tradeoffs in Quantized Linear Computations, ” International Symposium on Information Theory (ISIT), 2023 [arXiv].
  • Aug. 16th, 2022 – New papers in 2022 Information Theory Workshop:
    • C. Wang and N. Raviv, “Breaking Blockchain’s Communication Barrier with Coded Computation,” Information Theory Workshop (ITW), 2022.
    • C. Wang and N. Raviv, “All-to-all Encode in Synchronous Systems,” Information Theory Workshop (ITW), 2022.
    • X. Zuo, A. Jiang, N. Raviv, and P. H. Siegel, “Symbolic Regression for Data Storage with Side Information, (invited paper), Information Theory Workshop (ITW), 2022.
  • May 20th, 2022 – New paper:
    • C. Wang and N.Raviv, “Breaking Blockchain’s Communication Barrier with Coded Computation,” IEEE Journal on Selected Areas in Information Theory, 2022.
  • May 12th, 2022 – New paper:
    • C. Wang and N. Raviv, “All-to-all Encode in Synchronous Systems,” arXiv:2205.05183 [cs.DC], 2022.
  • Apr. 22nd, 2022 – New papers:
    • N. Raviv, R. Bitar, and E. Yaakobi, “Information Theoretic Private Inference in Quantized Models,” to appear in International Symposium on Information Theory (ISIT), 2022.
    • N. Raviv and Z. Goldfeld, “Perfect Subset Privacy for Data Sharing and Learning,” to appear in International Symposium on Information Theory (ISIT), 2022.
    • C. Wang and N. Raviv, “Breaking Blockchain’s Communication Barrier with Coded Computation,” arXiv:2204.00979 [cs.DC].
  • Sept. 15th, 2021 – New paper:
    S. Jain, B. Mazaheri, N. Raviv, and J. Bruck. “Glioblastoma signature in the DNA of blood-derived cells,” PloS one 16, no. 9 (2021): e0256831.
  • May 10th, 2021 – New paper:
    N. Raviv, A. Kelley, M. Guo, and E. Vorobeychik, “Enhancing Robustness of Neural Networks through Fourier Stabilization,” to appear in International Conference on Machine Learning (ICML), 2021.
  • Apr. 30th, 2021 – New paper:
    C. Wang and N. Raviv, “Low Latency Cross-Shard Transactions in Coded Blockchain,” to appear in International Symposium on Information Theory (ISIT), 2021.
  • Feb. 8th, 2021 – New paper:
    N. Raviv, B. Langton, and I. Tamo, “Multivariate public key cryptosystem from Sidon spaces”, to appear in Public Key Cryptography (PKC), 2021.
  • Jan. 11th, 2021 – New papers:
    • J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” arXiv:1809.02716 [cs.IT], to appear in Transactions on Information Theory, 2021.
    • N. Raviv, “Robust Neural Computation from Error Correcting Codes” (invited paper), IEEE Information Theory Workshop, (ITW), 2020.
  • Nov. 3rd, 2020 – New paper on arXiv:
    C. Wang and N. Raviv, “Low Latency Cross-Shard Transactions in Coded Blockchain,” arXiv:2011.00087 [cs.CR], 2020.