Presentation 1996/10/18
Effective Minimum Distance of Concatenated Convolutional Code
Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We present a new method for analyzing the overall bit error probability of concatenated codes which consist of an inner convolutional code and an outer interleaved Reed-Solomon code. The method is based on the effective minimum distance of an inner convolutional code and the multiple burst correctability of an outer block code.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) concatenated code / convolutional code / interleave / Reed-Solomon code / burst correction
Paper # SAT96-75,CS96-108
Date of Issue

Conference Information
Committee SAT
Conference Date 1996/10/18(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 Satellite Telecommunications (SAT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Effective Minimum Distance of Concatenated Convolutional Code
Sub Title (in English)
Keyword(1) concatenated code
Keyword(2) convolutional code
Keyword(3) interleave
Keyword(4) Reed-Solomon code
Keyword(5) burst correction
1st Author's Name Tadashi WADAYAMA
1st Author's Affiliation Okayama Prefectural University()
2nd Author's Name Koichiro WAKASUGI
2nd Author's Affiliation Kyoto Institute of Technology
3rd Author's Name Masao KASAHARA
3rd Author's Affiliation Kyoto Institute of Technology
Date 1996/10/18
Paper # SAT96-75,CS96-108
Volume (vol) vol.96
Number (no) 316
Page pp.pp.-
#Pages 8
Date of Issue