Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1311.4947 (cs)
[Submitted on 20 Nov 2013 (v1), last revised 6 Mar 2015 (this version, v3)]

Title:A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property

Authors:Jie Li, Xiaohu Tang, Udaya Parampalli
View PDF
Abstract:In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique. Codes constructed in our framework not only contain some best known codes as special cases, but also include some new codes with key properties such as the optimal access property and the optimal update property. In particular, for a given storage capacity of an individual node, one of the new codes has the largest number of systematic nodes and two of the new codes have the largest number of systematic nodes with the optimal update property.
Comments: Accepted for publication in IEEE Transactions on Information Theory
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1311.4947 [cs.IT]
  (or arXiv:1311.4947v3 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1311.4947
Related DOI: https://doi.org/10.1109/TIT.2015.2408600

Submission history

From: Jie Li [view email]
[v1] Wed, 20 Nov 2013 03:48:13 UTC (14 KB)
[v2] Sun, 17 Aug 2014 08:28:26 UTC (19 KB)
[v3] Fri, 6 Mar 2015 02:06:50 UTC (21 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2013-11
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Jie Li
Xiaohu Tang
Parampalli Udaya
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)