- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Note on Bounds on the Minimum Distance and the Dimension of $(n,k,d,r,t,x,y)_{q}$ LRC Codes (in Japanese) |
|---|---|
| Authors | Koki Kazama 、Akira Kamatsuka 、Toshiyasu Matsushima |
| Released Year | 2018 |
| Format | Conference |
| Category | Information security |
| Jounal Name | |
| Jounal Page | pp.82-87 |
| Published Year | 2018 |
| Published Month | 12 |
| Abstract （English） |
An LRC code is a code such that each codeword symbol can be recovered from other codeword symbols, which is called recovering set. Kruglik et al. derived bounds on the minimum distance and the dimension of $(n,k,d,r,t)_{q}$ LRC codes using shortening bounds, and Kruglik et al. derived bounds on the generalized Hamming weight of $(n,k,d,r,t,x)_{q}$ LRC codes. Shortening bounds are upper bounds which use previous bounds on the minimum distance and the dimension of codes like Singleton bounds. In this research, we propose $(n,k,d,r,t,x,y)_{q}$ LRC codes and we derive bounds on the minimum distance and the dimension of our proposed codes using shortening bounds. |
| Note （English） |
|
| Manuscript | |
| Presentation |
