Name
Abstract | ||
|---|---|---|
Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by $2^{fb}$, where $fb$ is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum storage of data, and meanwhile the number of nodes is unbounded. One of the candidates for such regenerating codes is an algebraic geometry code. In this paper, we generalize the repairing algorithm of Reed-Solomon codes given in cite[STOC2016]{GW16} to algebraic geometry codes and present an efficient repairing algorithm for arbitrary one-point algebraic geometry codes. By applying our repairing algorithm to the one-point algebraic geometry codes based on the Garcia-Stichtenoth tower, one can repair a code of rate $1-Ge$ and length $n$ over $F_{q}$ with bandwidth $(n-1)(1-Gt)log q$ for any $Ge=2^{(Gt-1/2)log q}$ with a real $tauin(0,1/2)$. In addition, storage in each node for an algebraic geometry code is close to the minimum storage. Due to nice structures of Hermitian curves, repairing of Hermitian codes is also investigated. As a result, we are able to show that algebraic geometry codes are regenerating codes with good parameters. An example reveals that Hermitian codes outperform Reed-Solomon codes for certain parameters. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Information Theory | Discrete mathematics,Algebraic geometry,Separable space,Bandwidth (signal processing),Code (cryptography),Hermitian matrix,Mathematics,Bounded function |
DocType | Volume | Citations |
Journal | abs/1710.01874 | 1 |
PageRank | References | Authors |
0.36 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lingfei Jin | 1 | 135 | 15.30 |
| Yuan Luo | 2 | 325 | 45.06 |
| Chaoping Xing | 3 | 916 | 110.47 |