A Note on a Bound on the Rate of a Locally Recoverable Code with Multiple Recovering Sets

Koki Kazama; Akira Kamatsuka; Takahiro Yoshida; Toshiyasu Matsushima

Summary

The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)

2018

Session Number:We-AM-Poster

Session:

Number:We-AM-Poster.30

A Note on a Bound on the Rate of a Locally Recoverable Code with Multiple Recovering Sets

Koki Kazama, Akira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima,

pp.520-520

Publication Date:2018/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.55.We-AM-Poster.30

PDF download

Summary:

A locally recoverable code (LRC code) is a code such that each codeword symbol can be recovered from other codeword symbols. In this research, we propose one possible generalization of previous LRC codes and we derive a bound on the rate of the proposed code.