Presentation 1996/7/26
On Decoding Capabilities of Concatenated Codes with Even Minimum Distance
Takashi SASAKI, Toshihisa NISHIJIMA, Toshiyuki KOHNOSU,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Concatenated code have remarkable capabilities of burst and random error-correction. Reddy-Robinson algorithm is well known as the decoding algorithm which can correct up to t_0 errors for concatenated codes with designed minimum distance d_0=2t_0+1. In this paper, by some computer simulations, we evaluate how many error patterns which are corectly decoded by using Reddy-Robinson algorithm for concatenated codes with even designed minimum distance d_0=2(t_0+1) there are in all error patterns having t_0+1 weight.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) concatenated code / Reddy-Robinson algorithm / bounded distance decoding / generalized minimum distance decoding
Paper # IT96-29
Date of Issue

Conference Information
Committee IT
Conference Date 1996/7/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) On Decoding Capabilities of Concatenated Codes with Even Minimum Distance
Sub Title (in English)
Keyword(1) concatenated code
Keyword(2) Reddy-Robinson algorithm
Keyword(3) bounded distance decoding
Keyword(4) generalized minimum distance decoding
1st Author's Name Takashi SASAKI
1st Author's Affiliation Department of Industrial and Systems Engineering, College of Engineering, Hosei University()
2nd Author's Name Toshihisa NISHIJIMA
2nd Author's Affiliation Department of Industrial and Systems Engineering, College of Engineering, Hosei University
3rd Author's Name Toshiyuki KOHNOSU
3rd Author's Affiliation Advanced research institute for science and engineering, Waseda University
Date 1996/7/26
Paper # IT96-29
Volume (vol) vol.96
Number (no) 203
Page pp.pp.-
#Pages 5
Date of Issue