On the Duality and File Size Hierarchy of Fractional Repetition Codes release_lx2u55dbsrbydb33zkyszvvfl4

by Bing Zhu, Kenneth W. Shum, Hui Li

Released as a article .

2018  

Abstract

Distributed storage systems that deploy erasure codes can provide better features such as lower storage overhead and higher data reliability. In this paper, we focus on fractional repetition (FR) codes, which are a class of storage codes characterized by the features of uncoded exact repair and minimum repair bandwidth. We study the duality of FR codes, and investigate the relationship between the supported file size of an FR code and its dual code. Based on the established relationship, we derive an improved dual bound on the supported file size of FR codes. We further show that FR codes constructed from t-designs are optimal when the size of the stored file is sufficiently large. Moreover, we present the tensor product technique for combining FR codes, and elaborate on the file size hierarchy of resulting codes.
In text/plain format

Archived Files and Locations

application/pdf  262.2 kB
file_gcn2b7e5vrfsfgrie42hp6p7hu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-08-06
Version   v1
Language   en ?
arXiv  1808.01933v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d63eeb28-16d4-41ba-8bea-0a1108120da6
API URL: JSON