Treffer: General Fractional Repetition Codes for Distributed Storage Systems

Title:
General Fractional Repetition Codes for Distributed Storage Systems
Source:
IEEE communications letters. 18(4):660-663
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2014.
Publication Year:
2014
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Shenzhen Eng. Lab of Converged Networks Technology and the Shenzhen Key Lab of Cloud Computing Technology and Application, Shenzhen Graduate School, Peking University, Shenzhen 518055, China
Shenzhen Key Laboratory of Network Coding Key Technology and Application, China
Shenzhen Research Institute. The Chinese University of Hong Kong, Hong-Kong
ISSN:
1089-7798
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.28495985
Database:
PASCAL Archive

Weitere Informationen

In order to provide fault-tolerance and guarantee reliability, data redundancy should be introduced in distributed storage systems. The emerging coding techniques for storage such as fractional repetition codes, provide the required redundancy more efficiently than the conventional replication scheme. In this letter, we extend the construction of fractional repetition codes and present a new coding scheme, termed general fractional repetition codes. The proposed codes can be applied to storage systems in which the storage capacities of nodes may be different. Based on a combinatorial structure known as group divisible design, the new code construction is available for a large set of parameters. The performance of the proposed codes is evaluated by a metric called node repair alternativity, which measures the number of different subsets of nodes that enable the repair of a specific failed node.