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 (r1, r2)i = (2, 3) and (r1, r2)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.
|Title of host publication||ITW 2015 - 2015 IEEE Information Theory Workshop|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|Publication status||Published - 2015 Dec 17|
|Event||IEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of|
Duration: 2015 Oct 11 → 2015 Oct 15
|Name||ITW 2015 - 2015 IEEE Information Theory Workshop|
|Other||IEEE Information Theory Workshop, ITW 2015|
|Country/Territory||Korea, Republic of|
|Period||15/10/11 → 15/10/15|
Bibliographical noteFunding Information:
ACKNOWLEDGMENT This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2013R1A1A2062061).
© 2015 IEEE.
All Science Journal Classification (ASJC) codes
- Information Systems