A lower bound on the probability of decoding error over a BSC channel

Osnat Keren, Simon Litsyn

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

Abstract

Given a code C of length n and size |C|, we are interested in estimating the error probability of the maximum likelihood decoding. In this talk we address this problem for the binary symmetric channel (BSC) defined by its transition probability p. There are several possible levels of our knowledge about the parameters of the code. Here we address the case when we have at our possession the distance distribution of the code. Further, we assume that the code is regular in the sense that the distribution of the distances from a code word to other code words does not depend on the choice of the initial word.

Original languageEnglish
Title of host publication21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages271-273
Number of pages3
ISBN (Electronic)0780358422, 9780780358423
DOIs
StatePublished - 2000
Event21st IEEE Convention of the Electrical and Electronic Engineers in Israel, IEEEI 2000 - Tel-Aviv, Israel
Duration: 11 Apr 200012 Apr 2000

Publication series

Name21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings

Conference

Conference21st IEEE Convention of the Electrical and Electronic Engineers in Israel, IEEEI 2000
Country/TerritoryIsrael
CityTel-Aviv
Period11/04/0012/04/00

Fingerprint

Dive into the research topics of 'A lower bound on the probability of decoding error over a BSC channel'. Together they form a unique fingerprint.

Cite this