Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909176521818112 |
|---|---|
| author | Chan, Chin Hei Fu, Fang-Wei Xiong, Maosheng |
| author_facet | Chan, Chin Hei Fu, Fang-Wei Xiong, Maosheng |
| contents | Using tools developed in a recent work by Shen and the second author, in this paper we carry out an in-depth study on the average decoding error probability of the random matrix ensemble over the erasure channel under three decoding principles, namely unambiguous decoding, maximum likelihood decoding and list decoding. We obtain explicit formulas for the average decoding error probabilities of the random matrix ensemble under these three decoding principles and compute the error exponents. Moreover, for unambiguous decoding, we compute the variance of the decoding error probability of the random matrix ensemble and the error exponent of the variance, which imply a strong concentration result, that is, roughly speaking, the ratio of the decoding error probability of a random code in the ensemble and the average decoding error probability of the ensemble converges to 1 with high probability when the code length goes to infinity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2108_09989 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel Chan, Chin Hei Fu, Fang-Wei Xiong, Maosheng Information Theory 94A40, 94B70 Using tools developed in a recent work by Shen and the second author, in this paper we carry out an in-depth study on the average decoding error probability of the random matrix ensemble over the erasure channel under three decoding principles, namely unambiguous decoding, maximum likelihood decoding and list decoding. We obtain explicit formulas for the average decoding error probabilities of the random matrix ensemble under these three decoding principles and compute the error exponents. Moreover, for unambiguous decoding, we compute the variance of the decoding error probability of the random matrix ensemble and the error exponent of the variance, which imply a strong concentration result, that is, roughly speaking, the ratio of the decoding error probability of a random code in the ensemble and the average decoding error probability of the ensemble converges to 1 with high probability when the code length goes to infinity. |
| title | Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel |
| topic | Information Theory 94A40, 94B70 |
| url | https://arxiv.org/abs/2108.09989 |