DocumentCode
181670
Title
A decoding algorithm for projective Reed-Muller codes of 2-dimensional projective space with DFT
Author
Nakashima, N. ; Matsui, H.
Author_Institution
Toyota Technol. Inst., Nagoya, Japan
fYear
2014
fDate
26-29 Oct. 2014
Firstpage
358
Lastpage
362
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.
Keywords
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; Australia; Computational complexity; Decoding; Discrete Fourier transforms; Electronic mail; Polynomials; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and its Applications (ISITA), 2014 International Symposium on
Conference_Location
Melbourne, VIC
Type
conf
Filename
6979865
Link To Document