Next Article in Journal
Comparative Performance Analysis of a Simplified Curzon-Ahlborn Engine
Previous Article in Journal
Detailed Fluctuation Theorems: A Unifying Perspective
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Entropy
Volume 20
Issue 9
10.3390/e20090636
entropy-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data

by
Kang-Seok Lee
1,
Hosung Park
2,* and
Jong-Seon No
3
1
Samsung Electronics, Co. Ltd., Hwasung, Gyeonggi-do 18448, Korea
2
School of Electronics and Computer Engineering, Chonnam National University, Gwangju 61186, Korea
3
Department of Electrical and Computer Engineering, Institute of New Media and Communications, Seoul National University, Seoul 08826, Korea
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(9), 636; https://doi.org/10.3390/e20090636
Submission received: 26 July 2018 / Revised: 18 August 2018 / Accepted: 23 August 2018 / Published: 25 August 2018
(This article belongs to the Section Information Theory, Probability and Statistics)
Browse Figures
Versions Notes

Abstract

In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot data is proposed, which has a high information symbol availability and low parity symbol availabilities for the local repair of distributed storage systems. The local repair of each information symbol for the proposed codes can be done not by accessing other information symbols but only by accessing parity symbols. The proposed BLRCs with k = 4 achieve the optimality on the information length for their given code length, minimum Hamming distance, locality, and availability in terms of the well-known theoretical upper bound.
Keywords: availability; distributed storage system (DSS); locality; locally repairable code (LRC) availability; distributed storage system (DSS); locality; locally repairable code (LRC)

Share and Cite

MDPI and ACS Style

Lee, K.-S.; Park, H.; No, J.-S. New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data. Entropy 2018, 20, 636. https://doi.org/10.3390/e20090636

AMA Style

Lee K-S, Park H, No J-S. New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data. Entropy. 2018; 20(9):636. https://doi.org/10.3390/e20090636

Chicago/Turabian Style

Lee, Kang-Seok, Hosung Park, and Jong-Seon No. 2018. "New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data" Entropy 20, no. 9: 636. https://doi.org/10.3390/e20090636

APA Style

Lee, K.-S., Park, H., & No, J.-S. (2018). New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data. Entropy, 20(9), 636. https://doi.org/10.3390/e20090636

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop