Presentation 2014-05-16
A method of parallel processing of syndromes to decode primitive BCH codes
Ken-ichi IWATA, Reiya OOSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider numbers of addition and multiplication operations to calculate an error syndrome for q-ary primitive BCH codes. The paper describes an algorithm to construct a circuit to calculate an error syndrome by 2t(q-1)(m+2((q^m-1)/(q-1)-m)) number of additions and (2t(q-2)(q^m-1))/(q-1) number of multiplications from the relationships of parity check matrix between Hamming codes and BCH codes. We evaluate the delay time of the circuit to calculate an error syndrome for q-ary primitive BCH codes, and show that it takes m([log_2 (q-1)]+1) δ_, where δ_ denotes a time to do a binary operation F_q×F_q→F_q.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Error-correcting codes / Hamming codes / BCH codes / parallel syndrome calculation
Paper # IT2014-5
Date of Issue

Conference Information
Committee IT
Conference Date 2014/5/9(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) A method of parallel processing of syndromes to decode primitive BCH codes
Sub Title (in English)
Keyword(1) Error-correcting codes
Keyword(2) Hamming codes
Keyword(3) BCH codes
Keyword(4) parallel syndrome calculation
1st Author's Name Ken-ichi IWATA
1st Author's Affiliation Department of Information Science, Graduate School of Engineering, University of Fukui()
2nd Author's Name Reiya OOSHIMA
2nd Author's Affiliation Department of Information Science, Graduate School of Engineering, University of Fukui
Date 2014-05-16
Paper # IT2014-5
Volume (vol) vol.114
Number (no) 34
Page pp.pp.-
#Pages 4
Date of Issue