Bounds on secure regenerating codes
134 views · Published 14 March 2016 · 46:01 · Indexed 6 November 2026
Channel: Institut Henri Poincaré · 2016 · Science & Technology
By Kenneth Shum (The Chinese University of Hong Kong) Abstract: Regenerating codes are coding schemes with applications in distributed storage systems, with the aim of repairing an erased storage node efficiently. For functional-repair regenerating codes, the fundamental tradeoff between the repair bandwidth and the amount of data stored in a storage node is characterized by formulating the problem as a single-source multi-cast problem in network coding. For exact-repair regenerating codes, the problem of characterizing the tradeoff between repair bandwidth and storage in general remains a challenging problem, and some breakthrough was obtained recently in some small cases. In this talk, we consider exact-repair regenerating codes in the presence of eavesdroppers, who are capable of reading the bits stored in a storage node. Bound on the rate of regenerating codes such that the eavesdroppers can get no information about the data file is obtained. The bound is shown to be tight in some small cases. This is a joint work with Fangwei Ye.
More from this channel
-
29:47
10 ans du Groupe Calcul : Histoire du Calcul - Introduction
-
52:14
Gauss, Jacobi, Seidel, Richardson, Krylov: the Invention of Iterative Methods
-
55:33
Les "invariants arithmétiques" de H. Poincaré
-
1:08:53
Henri Poincaré, a founding father of the modern theory of PDEs
-
57:13
Sympletic topology from Poincaré to Gromov
-
57:35
Structural Realism, Then and Now
-
46:26
Poincaré inequalities in probability and geometric analysis
-
1:02:05
On the contributions of Henri Poincaré to modern geophysics...