Michal Horovitz
Michal Horovitz
Tel-Hai College and The Galilee Research Institute - Migal, Israel
Adresse e-mail validée de telhai.ac.il
Titre
Citée par
Citée par
Année
Constructions of snake-in-the-box codes for rank modulation
M Horovitz, T Etzion
IEEE Transactions on Information Theory 60 (11), 7016-7025, 2014
172014
Mailbox-Based vs. Log-Based Query Completion for Mail Search
M Horovitz, L Lewin-Eytan, A Libov, Y Maarek, A Raviv
Proceedings of the 40th International ACM SIGIR Conference on Research and …, 2017
82017
On the Capacity of Write-Once Memories
M Horovitz, E Yaakobi
IEEE Transactions on Information Theory 63 (8), 5124-5137, 2017
52017
WOM codes with uninformed encoder
M Horovitz, E Yaakobi
2015 IEEE Information Theory Workshop (ITW), 1-5, 2015
52015
On the capacity of non-binary write-once memory
M Horovitz, E Yaakobi
2016 IEEE International Symposium on Information Theory (ISIT), 945-949, 2016
42016
Reconstruction of sequences over non-identical channels
M Horovitz, E Yaakobi
IEEE Transactions on Information Theory, 2018
32018
Local rank modulation for flash memories
M Horovitz, T Etzion
IEEE Transactions on Information Theory, 2018
3*2018
Codes for Endurance-Limited Memories
YM Chee, M Horovitz, A Vardy, VK Vu, E Yaakobi
The Int. Symp. Information Theory and Its Application, 2018
32018
Reconstruction of sequences over non-identical channels
M Horovitz, E Yaakobi
2017 IEEE International Symposium on Information Theory (ISIT), 2017
32017
Endurance-Limited Memories with Informed Decoder
YM Chee, M Horovitz, A Vardy, E Yaakobi
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
2019
Iterative Programming of Noisy Memory Cells
M Horovitz, E Yaakobi, EE Gad, J Bruck
2019 IEEE Information Theory Workshop (ITW), 2019
2019
Iterative Programming of Noisy Memory Cells
M Horovitz, E Yaakobi, EE Gad, J Bruck
arXiv preprint arXiv:1901.03084, 2019
2019
Coding Schemes for Non-Volatile Memories
M Horovitz, E Yaakobi, T Etzion
Computer Science Department, Technion, 2017
2017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–13