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 language | English |
---|---|
Title of host publication | 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 271-273 |
Number of pages | 3 |
ISBN (Electronic) | 0780358422, 9780780358423 |
DOIs | |
State | Published - 2000 |
Externally published | Yes |
Event | 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, IEEEI 2000 - Tel-Aviv, Israel Duration: 11 Apr 2000 → 12 Apr 2000 |
Publication series
Name | 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings |
---|
Conference
Conference | 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, IEEEI 2000 |
---|---|
Country/Territory | Israel |
City | Tel-Aviv |
Period | 11/04/00 → 12/04/00 |
Bibliographical note
Publisher Copyright:© 2002 IEEE.