Presentation 2001/5/16
An Estimation of Calculation Complexity for Parallel Decoding of Codes from Algebraic Curves
Hajime MATSUI, Seiichi MITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a new procedure of parallel computation for the unknown syndrome which appears in decoding of the codes constructed from a certain class of algebraic curves. This procedure can reduce the calculation complexity and the data amount for such codes. In particular, we show that this procedure is applicable to the codes from elliptic curwes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) error correcting codes / algebraic-geometric codes / Sakata algorithm / key words systolic array architecture / Grobner basis
Paper # IT2001-6
Date of Issue

Conference Information
Committee IT
Conference Date 2001/5/16(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Estimation of Calculation Complexity for Parallel Decoding of Codes from Algebraic Curves
Sub Title (in English)
Keyword(1) error correcting codes
Keyword(2) algebraic-geometric codes
Keyword(3) Sakata algorithm
Keyword(4) key words systolic array architecture
Keyword(5) Grobner basis
1st Author's Name Hajime MATSUI
1st Author's Affiliation Toyota Technological Institute Electronics and information Science()
2nd Author's Name Seiichi MITA
2nd Author's Affiliation Toyota Technological Institute Electronics and information Science
Date 2001/5/16
Paper # IT2001-6
Volume (vol) vol.101
Number (no) 70
Page pp.pp.-
#Pages 6
Date of Issue