Presentation 2001/3/15
An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC
Tadashi Wadayama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An algorithm for evaluating the decoding performance of maximumlikelihood decoding (MLD) with threshold test over a binary symmetric channel(BSC) is presented. The proposed algorithm,which is based on the dynamicprogramming principle, computes the exact values of the rejection probabilityThe computational complexity of the algorithm is O(n2^<(1-r)n>), Where n and rdenote length and coding rate of a target code.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Binary lienar code / threshold test / rejection probability
Paper # SEC2000-102
Date of Issue

Conference Information
Committee IT
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 Theory (IT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC
Sub Title (in English)
Keyword(1) Binary lienar code
Keyword(2) threshold test
Keyword(3) rejection probability
1st Author's Name Tadashi Wadayama
1st Author's Affiliation Faculty of Computer Science and System Engineering Okayama PrefecturaI University()
Date 2001/3/15
Paper # SEC2000-102
Volume (vol) vol.100
Number (no) 689
Page pp.pp.-
#Pages 8
Date of Issue