Referenced Items are not available for this document.
An efficient algorithm for calculating the ith bit error probability of a binary linear code over the binary symmetric channel (BSC) is presented. It is proved that the exact ith bit error probability of maximum-likelihood (ML) decoding, bounded distance decoding, and symbol-wise maximum a posteriori probability (MAP) decoding can be obtained with time complexity O(n2n-k), where n and k denote the length and the dimension of the target code. The proposed methods are applicable to any binary linear code with redundancy up to nearly 25-30 bits with a typical personal computer.
Published in:
Information Theory, IEEE Transactions on
(Volume:50
,
Issue:
2
)
Date of Publication: Feb. 2004
- Page(s):
- 331 - 337
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8004049
- Digital Object Identifier :
- 10.1109/TIT.2003.822617
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 19 February 2004
- Issue Date :
- Feb. 2004
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
