| Presentation | 2002/3/12 Top-down Recursive Maximum Liklihood Decoding Using Ordered Statistic Information Takuya KOUMOTO, Tadao KASAMI, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | To achieve optimal error performance on half rate binary linear codes of length 128 or larger is not easy. In this research, a new top-down style recursive maximum likelihood decoding using ordered statistic information is proposed. Simulation results on error performance and computational complexity are shown. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Recursive Maximum Likelihood Decoding / Ordered Statistic Information / Half Rate Code |
| Paper # | ISEC2001-113 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2002/3/12(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 Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Top-down Recursive Maximum Liklihood Decoding Using Ordered Statistic Information |
| Sub Title (in English) | |
| Keyword(1) | Recursive Maximum Likelihood Decoding |
| Keyword(2) | Ordered Statistic Information |
| Keyword(3) | Half Rate Code |
| 1st Author's Name | Takuya KOUMOTO |
| 1st Author's Affiliation | Faculty of Information Sciences, Hiroshima City University() |
| 2nd Author's Name | Tadao KASAMI |
| 2nd Author's Affiliation | Faculty of Information Sciences, Hiroshima City University |
| Date | 2002/3/12 |
| Paper # | ISEC2001-113 |
| Volume (vol) | vol.101 |
| Number (no) | 728 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |