Paper Abstract and Keywords |
Presentation |
2014-09-19 09:00
Fast Decoding Algorithm for Projective Reed-Muller Codes and Its Computational Complexity Norihiro Nakashima, Hajime Matsui (Toyota Tech. Inst.) IT2014-41 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Projective Reed--Muller (RM) codes were introduced as a generalization of RM codes, and the lowest wight and the dual code of PRM codes are known. Roughly speaking, a PRM code is divided into the direct sum of RM codes. Then we may considered syndromes related to PRM codes as syndromes related to corresponding RM codes. In this paper, by using a decoding method for affine variety codes, we construct a decoding method for PRM codes. Moreover, we compare the computational complexity of the proposed method
with previous decoding methods. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
projective Reed-Muller codes / affine variety codes / Grobner basis / Berlekamp-Massey-Sakata algorithm / discrete Fourier transformation / / / |
Reference Info. |
IEICE Tech. Rep., vol. 114, no. 224, IT2014-41, pp. 1-6, Sept. 2014. |
Paper # |
IT2014-41 |
Date of Issue |
2014-09-12 (IT) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
IT2014-41 |
Conference Information |
Committee |
IT |
Conference Date |
2014-09-19 - 2014-09-19 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
|
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
error correcting codes, general |
Paper Information |
Registration To |
IT |
Conference Code |
2014-09-IT |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Fast Decoding Algorithm for Projective Reed-Muller Codes and Its Computational Complexity |
Sub Title (in English) |
|
Keyword(1) |
projective Reed-Muller codes |
Keyword(2) |
affine variety codes |
Keyword(3) |
Grobner basis |
Keyword(4) |
Berlekamp-Massey-Sakata algorithm |
Keyword(5) |
discrete Fourier transformation |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Norihiro Nakashima |
1st Author's Affiliation |
Toyota Technological Institute (Toyota Tech. Inst.) |
2nd Author's Name |
Hajime Matsui |
2nd Author's Affiliation |
Toyota Technological Institute (Toyota Tech. Inst.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2014-09-19 09:00:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2014-41 |
Volume (vol) |
vol.114 |
Number (no) |
no.224 |
Page |
pp.1-6 |
#Pages |
6 |
Date of Issue |
2014-09-12 (IT) |
|