Moshe Twitto

Learn More
— The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel. The effectiveness of these bounds is(More)
The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential sphere bound (TSB) and two of its recent improved versions. The paper is focused on the derivation of the error exponents of these bounds. Although it was exemplified that some recent improvements of the TSB tighten this bound(More)
The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential-sphere bound (TSB) and some of its improved variations. The paper focuses on the derivation of the error exponents of these bounds. Although it was previously exemplified that some variations of the TSB suggest an improvement(More)
  • 1