New lower bounds on the error probability of a given block code

Asaf Cohen, Neri Merhav

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A novel technique for deriving lower bounds on the error probability when communicating one of M signals over a communication channel is proposed. At the basis of the technique, stands an improvement on a recent lower bound on the probability of a union of events by de Caen. The new bound includes a function which can be optimized in order to achieve the tightest results. By applying this bound to the problem of lower bounding the error probability, while suggesting an appropriate optimization function, in the spirit of the relevant channel model and type of the code, new bounds on the error probability can be derived. In this talk, we apply the new bound to the problem of lower bounding the error probability of binary linear codes over the Binary Symmetric Channel (BSC). The resulting bound improves on the latest bound appearing in the current literature, by Keren and Litsyn.

Original languageEnglish
Title of host publication22nd Convention of Electrical and Electronics Engineers in Israel, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages138-140
Number of pages3
ISBN (Electronic)0780376935
DOIs
StatePublished - 1 Jan 2002
Externally publishedYes
Event22nd Convention of Electrical and Electronics Engineers in Israel - Tel-Aviv, Israel
Duration: 1 Dec 2002 → …

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings
Volume2002-January

Conference

Conference22nd Convention of Electrical and Electronics Engineers in Israel
Country/TerritoryIsrael
CityTel-Aviv
Period1/12/02 → …

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'New lower bounds on the error probability of a given block code'. Together they form a unique fingerprint.

Cite this