Natalia Silberstein
Natalia Silberstein
Yahoo Research
cs.technion.ac.il üzerinde doğrulanmış e-posta adresine sahip
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Optimal locally repairable and secure codes for distributed storage systems
AS Rawat, OO Koyluoglu, N Silberstein, S Vishwanath
IEEE Transactions on Information Theory 60 (1), 212-236, 2013
2522013
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
T Etzion, N Silberstein
IEEE Transactions on Information Theory 55 (7), 2909-2919, 2009
1932009
Optimal locally repairable codes via rank-metric codes
N Silberstein, AS Rawat, OO Koyluoglu, S Vishwanath
2013 IEEE International Symposium on Information Theory, 1819-1823, 2013
1642013
Codes and designs related to lifted MRD codes
T Etzion, N Silberstein
IEEE Transactions on Information Theory 59 (2), 1004-1017, 2012
912012
Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks
N Silberstein, AL Trautmann
IEEE Transactions on Information Theory 61 (7), 3937-3953, 2015
582015
Explicit MBR all-symbol locality codes
GM Kamath, N Silberstein, N Prakash, AS Rawat, V Lalitha, OO Koyluoglu, ...
2013 IEEE International Symposium on Information Theory, 504-508, 2013
562013
Optimal fractional repetition codes based on graphs and designs
N Silberstein, T Etzion
IEEE Transactions on Information Theory 61 (8), 4164-4180, 2015
54*2015
Error resilience in distributed storage via rank-metric codes
N Silberstein, AS Rawat, S Vishwanath
2012 50th Annual Allerton Conference on Communication, Control, and …, 2012
542012
Optimal binary locally repairable codes via anticodes
N Silberstein, A Zeh
2015 IEEE International Symposium on Information Theory (ISIT), 1247-1251, 2015
452015
Optimal combinatorial batch codes based on block designs
N Silberstein, A Gál
Designs, Codes and Cryptography 78 (2), 409-424, 2016
402016
Large constant dimension codes and lexicodes
N Silberstein, T Etzion
arXiv preprint arXiv:1003.4879, 2010
372010
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
342017
Enumerative coding for Grassmannian space
N Silberstein, T Etzion
IEEE transactions on information theory 57 (1), 365-374, 2010
302010
Error-correcting regenerating and locally repairable codes via rank-metric codes
N Silberstein, AS Rawat, S Vishwanath
IEEE Transactions on Information Theory 61 (11), 5765-5778, 2015
282015
Codes and designs related to lifted MRD codes
N Silberstein, T Etzion
2011 IEEE International Symposium on Information Theory Proceedings, 2288-2292, 2011
182011
Locality and availability of array codes constructed from subspaces
N Silberstein, T Etzion, M Schwartz
IEEE Transactions on Information Theory 65 (5), 2648-2660, 2018
162018
On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
J Rosenthal, N Silberstein, AL Trautmann
Designs, codes and cryptography 73 (2), 393-416, 2014
152014
Network coding and subspace designs
M Greferath, MO Pavčević, N Silberstein, MÁ Vázquez-Castro
Springer, 2018
142018
List Decoding of Lifted Gabidulin Codes via the Pl\" ucker Embedding
AL Trautmann, N Silberstein, J Rosenthal
arXiv preprint arXiv:1301.2165, 2013
142013
New lower bounds for constant dimension codes
N Silberstein, AL Trautmann
2013 IEEE International Symposium on Information Theory, 514-518, 2013
132013
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20