On Code Rates of Fractional Repetition Codes

On Code Rates of Fractional Repetition Codes

In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{M...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2017-11
Hauptverfasser: Benerjee, Krishna Gopal, Gupta, Manish K
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Error analysis
Matrix representation
Packets (communication)
Repetition
Storage systems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Benerjee, Krishna Gopal
Gupta, Manish K
description In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2076812612</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2076812612</sourcerecordid><originalsourceid>FETCH-proquest_journals_20768126123</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQ8c9TcM5PSVUISixJLVbIT1NwK0pMLsnMz0vMUQhKLUgtyQRxwGqKeRhY0xJzilN5oTQ3g7Kba4izh25BUX5haWpxSXxWfmkRUGdxvJGBuZmFoZGZoZExcaoAJxcw1w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2076812612</pqid></control><display><type>article</type><title>On Code Rates of Fractional Repetition Codes</title><source>Freely Accessible Journals</source><creator>Benerjee, Krishna Gopal ; Gupta, Manish K</creator><creatorcontrib>Benerjee, Krishna Gopal ; Gupta, Manish K</creatorcontrib><description>In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Codes ; Error analysis ; Matrix representation ; Packets (communication) ; Repetition ; Storage systems</subject><ispartof>arXiv.org, 2017-11</ispartof><rights>2017. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Benerjee, Krishna Gopal</creatorcontrib><creatorcontrib>Gupta, Manish K</creatorcontrib><title>On Code Rates of Fractional Repetition Codes</title><title>arXiv.org</title><description>In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.</description><subject>Codes</subject><subject>Error analysis</subject><subject>Matrix representation</subject><subject>Packets (communication)</subject><subject>Repetition</subject><subject>Storage systems</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQ8c9TcM5PSVUISixJLVbIT1NwK0pMLsnMz0vMUQhKLUgtyQRxwGqKeRhY0xJzilN5oTQ3g7Kba4izh25BUX5haWpxSXxWfmkRUGdxvJGBuZmFoZGZoZExcaoAJxcw1w</recordid><startdate>20171124</startdate><enddate>20171124</enddate><creator>Benerjee, Krishna Gopal</creator><creator>Gupta, Manish K</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20171124</creationdate><title>On Code Rates of Fractional Repetition Codes</title><author>Benerjee, Krishna Gopal ; Gupta, Manish K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20768126123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Codes</topic><topic>Error analysis</topic><topic>Matrix representation</topic><topic>Packets (communication)</topic><topic>Repetition</topic><topic>Storage systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Benerjee, Krishna Gopal</creatorcontrib><creatorcontrib>Gupta, Manish K</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Benerjee, Krishna Gopal</au><au>Gupta, Manish K</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>On Code Rates of Fractional Repetition Codes</atitle><jtitle>arXiv.org</jtitle><date>2017-11-24</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2017-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2076812612
source Freely Accessible Journals
subjects Codes
Error analysis
Matrix representation
Packets (communication)
Repetition
Storage systems
title On Code Rates of Fractional Repetition Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T03%3A54%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=On%20Code%20Rates%20of%20Fractional%20Repetition%20Codes&rft.jtitle=arXiv.org&rft.au=Benerjee,%20Krishna%20Gopal&rft.date=2017-11-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2076812612%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2076812612&rft_id=info:pmid/&rfr_iscdi=true