- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Consideration on Minimum Storage Regenerating Codes for Functions (in Japanese) |
|---|---|
| Authors | 吉田隆弘 、地主創 、松嶋敏泰 |
| Released Year | 2012 |
| Format | Conference |
| Category | Information security |
| Jounal Name | |
| Jounal Page | vol.112, no.461, pp.107-112 |
| Published Year | 2013 |
| Published Month | 2 |
| Abstract （English） |
We consider regenerating codes for functions. Regenerating codes are a class of codes for distributed storage systems that enable a data collector to recover the original data by connecting to any k of n storage nodes, and also can repair a failed node by downloading data from any d(≧k)nodes. In this study, we present explicit construction of regenerating codes for function (p(.)that enable a data collector to compute (p(x)for input J by connecting to any k;nodes and sending J to all connected nodes. The presented codes can repair a failed node by downloading data from any d (≧k)nodes as with regenerating codes, and achieve the minimum storage capacity. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
Involved Papers
- Hierarchical Multi-label Classification on Statistical Decision Theory (in Japanese)
- A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming (in Japanese)
- An Efficient Algorithm for the Bayes Codes using an Unlimited Depth Context Tree
- Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel (in Japanese)
- A Note on the Fixed-Length Source Coding Theorems for Sources with Side Information (in Japanese)
