Natalia Silberstein

Natalia Silberstein

Auto-generated profile, based on publicly available information

Natalia Silberstein

Technion—Israel Institute of Technology

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 September 2014 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
NSNatalia Silberstein
Natalia Silberstein
AGAnna Gál
Anna Gál

16 October 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NSNatalia Silberstein
Natalia Silberstein
TETuvi Etzion
Tuvi Etzion
MSMoshe Schwartz
Moshe Schwartz
We study array codes which are based on subspaces of a linear space over a finite field, using spreads, q-Steiner systems, and subspace transversal designs. We present several constructions of such codes which are q-analogs of some known block codes such as the Hamming and simplex codes.We examine the locality and availability of the constructed codes. In particular we distinguish between two types of locality and availability – node vs. symbol, locality and availability. The resulting codes have distinct symbol/node locality/availability, allowing a more efficient repair process for a single symbol stored in a storage node of a distributed storage system, compared with the repair process for the whole node.

22 September 2015 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NSNatalia Silberstein
Natalia Silberstein
ARAnkit Singh Rawat
Ankit Singh Rawat
SVSriram Vishwanath
Sriram Vishwanath
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors.

20 April 2017 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
NSNatalia Silberstein
Natalia Silberstein
AZAlexander Zeh
Alexander Zeh

21 February 2014 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
JRJoachim Rosenthal
Joachim Rosenthal
NSNatalia Silberstein
Natalia Silberstein
ATAnna-Lena Trautmann
Anna-Lena Trautmann

1 January 2015
Verified
Book Chapter
Closed access
PDF file
NSNatalia Silberstein
Natalia Silberstein