Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912199731052544 |
|---|---|
| author | Philosof, Tal Doubchak, Ariel Berman, Amit Erez, Uri |
| author_facet | Philosof, Tal Doubchak, Ariel Berman, Amit Erez, Uri |
| contents | The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's weight spectrum. In the present work, the bound is extended to memoryless symmetric channels with a discrete output alphabet. The derived bound is demonstrated on a hybrid BSC-BEC channel. Additionally, a reduced-complexity bound is introduced at the cost of some loss in tightness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13021 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels Philosof, Tal Doubchak, Ariel Berman, Amit Erez, Uri Information Theory The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's weight spectrum. In the present work, the bound is extended to memoryless symmetric channels with a discrete output alphabet. The derived bound is demonstrated on a hybrid BSC-BEC channel. Additionally, a reduced-complexity bound is introduced at the cost of some loss in tightness. |
| title | Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.13021 |