Name
Abstract | ||
|---|---|---|
The Reed-Muller (RM) code, encoding n-variate degree-d polynomials over Fq for d <; q, with its evaluation on Fqn, has a relative distance 1 - d/q and can be list decoded from a 1- O(√d/q) fraction of errors. In this paper, for d ≪ q, we give a length-efficient puncturing of such codes, which (almost) retains the distance and list decodability properties of the RM code, but has a much better rate.... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TIT.2017.2692212 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Decoding,Reed-Solomon codes,Zinc,Computer science,Mobile communication,Education,Geometry | Discrete mathematics,Combinatorics,Polynomial,Algebraic function field,Multiplication,Omega,Concatenation,Reed–Muller code,List decoding,Puncturing,Mathematics | Journal |
Volume | Issue | ISSN |
63 | 7 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Guruswami | 1 | 3205 | 247.96 |
| Lingfei Jin | 2 | 135 | 15.30 |
| Chaoping Xing | 3 | 916 | 110.47 |