In this paper, we propose a construction of binary locally repairable codes from complete multipartite graphs. Our codes possess joint locality (r1 = 2, r2 = 3 or 4). Joint locality is a set of numbers of symbols for repairing various erasure patterns of symbols. We also provide availability properties of our codes. A code is said to have (r, t)-availability if each of its symbols can be repaired by t disjoint groups of other symbols, each of a size of at most r. As a meaningful result, the proposed code construction can generate binary locally repairable codes achieving (2, t)-availability for any positive integer t.
|Title of host publication||International Conference on ICT Convergence 2015|
|Subtitle of host publication||Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||3|
|Publication status||Published - 2015 Dec 11|
|Event||6th International Conference on Information and Communication Technology Convergence, ICTC 2015 - Jeju Island, Korea, Republic of|
Duration: 2015 Oct 28 → 2015 Oct 30
|Name||International Conference on ICT Convergence 2015: Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015|
|Other||6th International Conference on Information and Communication Technology Convergence, ICTC 2015|
|Country/Territory||Korea, Republic of|
|Period||15/10/28 → 15/10/30|
Bibliographical noteFunding Information:
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
- Computer Networks and Communications
- Information Systems