Name
Title | ||
|---|---|---|
A decoding algorithm for projective Reed-Muller codes of 2-dimensional projective space with DFT |
Abstract | ||
|---|---|---|
We show a decoding system for projective Reed-Muller codes of 2-dimensional projective space via the discrete Fourier transformation. The projective space can be regarded as the disjoint union of separated affine spaces. This is a key for our decoding system. The proposed system with the discrete Fourier transformation enables us to decode such codes faster with less computational complexity. |
Year | Venue | Keywords |
|---|---|---|
2014 | ISITA | Reed-Muller codes,computational complexity,discrete Fourier transforms,2-dimensional projective space,DFT,computational complexity,decoding algorithm,decoding system,discrete Fourier transformation,projective Reed-Muller codes |
Field | DocType | Citations |
Discrete mathematics,Berlekamp–Welch algorithm,Sequential decoding,Algebra,Computer science,Reed–Muller code,Decoding methods,List decoding,Projective test,Projective space | Conference | 3 |
PageRank | References | Authors |
0.47 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nakashima, N. | 1 | 3 | 0.81 |
| Hajime Matsui | 2 | 18 | 8.14 |