| Autor: |
Chang, Ling-Hua, Chen, Po-Ning, Alajaji, Fady, Han, Yunghsiang S. |
| Předmět: |
|
| Zdroj: |
IEEE Transactions on Information Theory; Jun2022, Vol. 68 Issue 6, p3501-3510, 10p |
| Abstrakt: |
The generalized Poor-Verdú error lower bound established by Chang et al. (2020) for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence of block codes sent over the memoryless binary symmetric channel (BSC), the minimum probability of error (under maximum likelihood decoding) has a relative deviation from the generalized bound that grows at most linearly in blocklength. This result directly implies that for arbitrary codes used over the BSC, decoder ties can only affect the subexponential behavior of the minimum probability of error. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
