Optimal binary locally repairable codes with joint information locality

We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r 1 , r 2 )i = (2, 3) and (r 1 , r 2 )i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repa...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE Information Theory Workshop - Fall (ITW) pp. 54 - 58
Main Authors Jung-Hyun Kim, Mi-Young Nam, Hong-Yeop Song
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2015
Subjects
Conferences
Electronic mail
Industries
Linear codes
Maintenance engineering
Online AccessGet full text

Cover

More Information
Summary:We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r 1 , r 2 )i = (2, 3) and (r 1 , r 2 )i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.
DOI:10.1109/ITWF.2015.7360733