Presentation 1994/1/26
Construction of efficient codes based on Reed-Solomon code.
Naomi Makino, Masao Kasahara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently,we have proposed method of decoding 2D cyclic codes by using the possible choices of total orders parallel in executing the Sakata algorithm.Our aim has been to reduce the computational complexity of the decoding method(1991) based on the choices of the syndrome values shown by Sakata(1991).Now we have investigated how effective our method is for the binary 2D cyclic codes given by Jensen(1985).As a result,we show that one can decode up to the half of the the minimum distance for some codes,and one can decode up to the nearly half of the minimum distance for some other codes. We also discuss the details of our decoding method and some comparisons with other decoding method,i.e.the method of choice-of- syndrome-values.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) two-dimensional cyclic codes / decoding / Sakata algorithm / method of choice-of-total-orders
Paper # IT93-97
Date of Issue

Conference Information
Committee IT
Conference Date 1994/1/26(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) Construction of efficient codes based on Reed-Solomon code.
Sub Title (in English)
Keyword(1) two-dimensional cyclic codes
Keyword(2) decoding
Keyword(3) Sakata algorithm
Keyword(4) method of choice-of-total-orders
1st Author's Name Naomi Makino
1st Author's Affiliation Department of Information Science and Design,Kyoto Institute of Technology()
2nd Author's Name Masao Kasahara
2nd Author's Affiliation Department of Information Science and Design,Kyoto Institute of Technology
Date 1994/1/26
Paper # IT93-97
Volume (vol) vol.93
Number (no) 437
Page pp.pp.-
#Pages 6
Date of Issue