Name
Abstract | ||
|---|---|---|
The stopping sets and stopping set distribution of a binary linear code play an important role in the iterative decoding of the linear code over a binary erasure channel. In this paper, we study stopping sets and stopping distributions of some residue algebraic geometry (AG) codes. For the simplest AG code, i.e., generalized Reed-Solomon code, it is easy to determine all the stopping sets. Then we consider AG codes from elliptic curves. We use the group structure of rational points of elliptic curves to present a complete characterization of stopping sets. Then the stopping sets, the stopping set distribution and the stopping distance of the AG code from an elliptic curve are reduced to the search, computing and decision versions of the subset sum problem in the group of rational points of the elliptic curve, respectively. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-29952-0_31 | TAMC |
Keywords | Field | DocType |
rational point,elliptic curve,group structure,generalized reed-solomon code,binary linear code,simplest ag code,linear code,algebraic geometry code,complete characterization,binary erasure channel,ag code | Discrete mathematics,Algebraic geometry,Combinatorics,Subset sum problem,Group structure,Stopping set,Binary erasure channel,Linear code,Decoding methods,Mathematics,Elliptic curve | Conference |
Citations | PageRank | References |
1 | 0.38 | 28 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Zhang | 1 | 1 | 0.72 |
| Fu Fang-Wei | 2 | 381 | 57.23 |
| Daqing Wan | 3 | 152 | 23.51 |