Netanel Raviv
Netanel Raviv
Adresse e-mail validée de email.wustl.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Lagrange coded computing: Optimal design for resiliency, security, and privacy
Q Yu, S Li, N Raviv, SMM Kalan, M Soltanolkotabi, SA Avestimehr
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
1002019
Gradient coding from cyclic MDS codes and expander graphs
N Raviv, R Tandon, A Dimakis, I Tamo
International Conference on Machine Learning, 4305-4313, 2018
812018
Subspace polynomials and cyclic subspace codes
E Ben-Sasson, T Etzion, A Gabizon, N Raviv
IEEE Transactions on Information Theory 62 (3), 1157-1165, 2016
362016
Constructions of high-rate minimum storage regenerating codes over small fields
N Raviv, N Silberstein, T Etzion
IEEE Transactions on Information Theory 63 (4), 2015-2038, 2017
292017
Some Gabidulin codes cannot be list decoded efficiently at any radius
N Raviv, A Wachter-Zeh
IEEE Transactions on Information Theory 62 (4), 1605-1615, 2016
232016
Equidistant codes in the Grassmannian
T Etzion, N Raviv
Discrete Applied Mathematics 186, 87-97, 2015
202015
Private information retrieval is graph based replication systems
N Raviv, I Tamot
2018 IEEE International Symposium on Information Theory (ISIT), 1739-1743, 2018
192018
Private polynomial computation from Lagrange encoding
N Raviv, DA Karpuk
IEEE Transactions on Information Forensics and Security 15, 553-563, 2019
142019
On coding over sliced information
J Sima, N Raviv, J Bruck
2019 IEEE International Symposium on Information Theory (ISIT), 767-771, 2019
132019
Two deletion correcting codes from indicator vectors
J Sima, N Raviv, J Bruck
IEEE Transactions on Information Theory 66 (4), 2375-2391, 2019
122019
Distributed storage systems based on intersecting subspace codes
N Raviv, T Etzion
2015 IEEE International Symposium on Information Theory (ISIT), 1462-1466, 2015
92015
Some Gabidulin codes cannot be list decoded efficiently at any radius
N Raviv, A Wachter-Zeh
2015 IEEE International Symposium on Information Theory (ISIT), 6-10, 2015
72015
Constructions of high-rate MSR codes over small fields
N Raviv, N Silberstein, T Etzion
arXiv preprint arXiv:1505.00919, 2015
72015
Rank modulation codes for DNA storage
N Raviv, M Schwartz, E Yaakobi
2017 IEEE International Symposium on Information Theory (ISIT), 3125-3129, 2017
62017
Access-optimal MSR codes with optimal sub-packetization over small fields
N Raviv, N Silberstein, T Etzion
CoRR, vol. abs/1505.00919, 2015
62015
LDPC Codes Over the -ary Multi-Bit Channel
R Cohen, N Raviv, Y Cassuto
IEEE Transactions on Information Theory 65 (7), 4293-4306, 2019
42019
Erasure correction of scalar codes in the presence of stragglers
N Raviv, Y Cassuto, R Cohen, M Schwartz
2018 IEEE International Symposium on Information Theory (ISIT), 1983-1987, 2018
42018
Rank-modulation codes for DNA storage with shotgun sequencing
N Raviv, M Schwartz, E Yaakobi
IEEE Transactions on Information Theory 65 (1), 50-64, 2018
42018
Asymptotically optimal regenerating codes over any field
N Raviv
IEEE Transactions on Information Theory 64 (11), 7178-7187, 2018
42018
Construction of Sidon spaces with applications to coding
RM Roth, N Raviv, I Tamo
IEEE Transactions on Information Theory 64 (6), 4412-4422, 2017
42017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20