Sökning: id:"swepub:oai:research.chalmers.se:35704048-abda-44df-a7fd-0907cf004f6d" >
A Family of Erasure...
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
-
- Kumar, Siddhartha, 1991 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Graell i Amat, Alexandre, 1976 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
Andriyanova, Iryna (författare)
-
visa fler...
-
- Brännström, Fredrik, 1974 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
visa färre...
-
(creator_code:org_t)
- ISBN 9781479959525
- 2015
- 2015
- Engelska.
-
Ingår i: Proceedings - IEEE Global Communications Conference, GLOBECOM. - 2334-0983 .- 2576-6813. - 9781479959525
- Relaterad länk:
-
http://publications.... (primary) (free)
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols. The primary goal of the first class of symbols is to provide good erasure correcting capability, while the second class facilitates node repair, reducing the repair bandwidth and the repair complexity. We compare the proposed codes with other codes proposed in the literature.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas