Presentation | 1996/10/18 Attaining Forney's Error Exponent with Convolutional Codes Takeshi Hashimoto, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Forney proposed an optimal Type-I hybrid ARQ scheme and proved a error exponent function known as Forney's expoent. It is an interesting problem if this exponent has its dual form for convolutional codes without exccesive needs for decoder complexity. In this paper, we propose a new erasure scheme, denoted by MR+Th, and show that the dual form of Forney's exponent is attained for convolutional codes with this new erasure decision scheme. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | undetected error probability / random coding, ARQ / convolutional codes / Forney's expongnt |
Paper # | IT96-43 |
Date of Issue |
Conference Information | |
Committee | IT |
---|---|
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 | Information Theory (IT) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Attaining Forney's Error Exponent with Convolutional Codes |
Sub Title (in English) | |
Keyword(1) | undetected error probability |
Keyword(2) | random coding, ARQ |
Keyword(3) | convolutional codes |
Keyword(4) | Forney's expongnt |
1st Author's Name | Takeshi Hashimoto |
1st Author's Affiliation | Dept. Electrical Engineering, Univ. Electro-Communications() |
Date | 1996/10/18 |
Paper # | IT96-43 |
Volume (vol) | vol.96 |
Number (no) | 311 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |