| Presentation | 2001/3/15 On Recursive Maximum Likelihood Decoding Algorithms for Linear Codes Tadao Kasami, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | First, top-down RMLD(recursive maximum likelihood decoding[1])algorithms [2-5] are reviewed. Then, a concept of conditional syndrome is introduced. Based on this, sufficient conditions of most likely local sub-codewords in top-down RMLD algorithms are presented. These conditions lead to efficient implementations of top-down RMLD algorithms. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | maximum likelihood decoding / recursive decoding / sufficient conditions / binary linear block codes / syndromes / TOGM |
| Paper # | ISEC2000-112 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2001/3/15(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) | On Recursive Maximum Likelihood Decoding Algorithms for Linear Codes |
| Sub Title (in English) | |
| Keyword(1) | maximum likelihood decoding |
| Keyword(2) | recursive decoding |
| Keyword(3) | sufficient conditions |
| Keyword(4) | binary linear block codes |
| Keyword(5) | syndromes |
| Keyword(6) | TOGM |
| 1st Author's Name | Tadao Kasami |
| 1st Author's Affiliation | Faculty of Information Sciences, Hiroshima City University() |
| Date | 2001/3/15 |
| Paper # | ISEC2000-112 |
| Volume (vol) | vol.100 |
| Number (no) | 691 |
| Page | pp.pp.- |
| #Pages | 9 |
| Date of Issue | |