Results 151 to 160 of about 197 (185)
Some of the next articles are maybe not open access.
2021 IEEE International Symposium on Information Theory (ISIT), 2021
We estimate the communication complexity of node repair for regenerating codes defined on graphs. Both deterministic and random graphs are considered.
Alexander Barg
exaly +2 more sources
We estimate the communication complexity of node repair for regenerating codes defined on graphs. Both deterministic and random graphs are considered.
Alexander Barg
exaly +2 more sources
IEEE Communications Letters, 2011
Regenerating codes are mainly justified due to their ability to reduce the repair bandwidth incurred by a newcomer node. This happens when a node fails or leaves the network, thus a new node is initiated, attempting to connect to existing nodes to reconstruct the data. This paper aims to investigate the case in which the newcomer can wisely select some
Abbas Kiani, Soroush Akhlaghi
exaly +2 more sources
Regenerating codes are mainly justified due to their ability to reduce the repair bandwidth incurred by a newcomer node. This happens when a node fails or leaves the network, thus a new node is initiated, attempting to connect to existing nodes to reconstruct the data. This paper aims to investigate the case in which the newcomer can wisely select some
Abbas Kiani, Soroush Akhlaghi
exaly +2 more sources
Secure Regenerating Codes Using Linear Regenerating Codes and the All-or-Nothing Transform
IEICE Transactions on Information and Systems, 2017 Hidenori Kuwakado
exaly +3 more sources
A connection between locally repairable codes and exact regenerating codes [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established.
Camilla Hollanti +2 more
exaly +5 more sources
Explicit Minimum Storage Regenerating Codes
IEEE Transactions on Information Theory, 2016In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting codes. Regenerating code is a type of code with two properties: first, it can reconstruct the entire file in the presence of any $r$ node erasures for some specified integer $r$ ; second, it can efficiently repair an erased node from any subset of ...
Jehoshua Bruck +2 more
exaly +3 more sources
2014 IEEE Global Communications Conference, 2014
Distributed storage plays a crucial role in the current cloud computing framework. After the theoretical bound for distributed storage was derived by the pioneer work of the regenerating code, Reed-Solomon code based regenerating codes, including the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code, were ...
Jian Li 0007, Tongtong Li, Jian Ren 0001
openaire +1 more source
Distributed storage plays a crucial role in the current cloud computing framework. After the theoretical bound for distributed storage was derived by the pioneer work of the regenerating code, Reed-Solomon code based regenerating codes, including the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code, were ...
Jian Li 0007, Tongtong Li, Jian Ren 0001
openaire +1 more source
On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes
IEEE Journal on Selected Areas in Information Theory, 2022Lalitha Vadlamani, Shreya Gupta
exaly +2 more sources
Regenerating codes over a binary cyclic code
2014 IEEE International Symposium on Information Theory, 2014We present a design framework of regenerating codes for distributed storage systems which employ binary additions and bit-wise cyclic shifts as the basic operations. The proposed coding method can be regarded as a concatenation coding scheme with the outer code being a binary cyclic code, and the inner code a regenerating code utilizing the binary ...
Kenneth W. Shum +4 more
openaire +1 more source
New Regenerating Codes over Binary Cyclic Codes
2019 IEEE International Symposium on Information Theory (ISIT), 2019Regenerating code is a class of erasure codes designed for distributed storage systems that can achieve optimal tradeoff between storage and repair bandwidth. Most existing constructions of regenerating codes are based on a finite field with large enough size. Recently, a new construction of regenerating codes over a binary cyclic code was proposed. It
Hanxu Hou +2 more
exaly +2 more sources
Codes With Local Regeneration and Erasure Correction
IEEE Transactions on Information Theory, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Govinda M. Kamath +3 more
openaire +2 more sources