Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels

Tal Philosof, Ariel Doubchak, Amit Berman +1

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 add…