Abstract—We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results. I
In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting codes...
In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regen...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
In a locally recoverable or recoverable code, any symbol of a codeword can be recovered by reading o...
Abstract—In this paper we study distributed storage systems with exact repair. We give a constructio...
Erasure coding techniques are used to increase the reliability of distributed storage systems while ...
We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage syste...
In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting...
Abstract—Motivated by distributed storage applications, we investigate the degree to which capacity ...
In this paper distributed storage systems with exact repair are studied. A construction for regenera...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
In this paper, three outer bounds on the normalised storage-repair bandwidth trade-off of regenerati...
In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting codes...
In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regen...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
In a locally recoverable or recoverable code, any symbol of a codeword can be recovered by reading o...
Abstract—In this paper we study distributed storage systems with exact repair. We give a constructio...
Erasure coding techniques are used to increase the reliability of distributed storage systems while ...
We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage syste...
In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting...
Abstract—Motivated by distributed storage applications, we investigate the degree to which capacity ...
In this paper distributed storage systems with exact repair are studied. A construction for regenera...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
In this paper, three outer bounds on the normalised storage-repair bandwidth trade-off of regenerati...
In distributed storage, a file is stored in a set of nodes and protected by erasure-correcting codes...
In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regen...
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-S...
DOI
Add to ORKG