Please login using the form on menu list.|
It is required to login for Full-Text PDF.
Decoder Error Probability of Binary Linear Block Codes and Its Application to Binary Primitive BCH Codes
Jae Hong LEE
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E79-A No.4 pp.592-599
Publication Date: 1996/04/20
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Theory and Coding Theory
decorder error probability,
bounded distance decorder,
Full Text: PDF(547KB)
McEliece and Swanson offerred an upper bound on the decorder error probability of Reed-Solomon codes. In this paper, we investigate the decorder error probability of binary linear block codes and verify its properties, and apply it to binary primitive BCH codes. It is shown that the decorder error probability of an (n,k,t) binary linear block code is determined by PE uniquely if it is a constant. We derive the decorder error probability of (n,k,t) binary primitive BCH codes with n=2m-1 and +1 and show that the decorder error probabilities of those codes are close to PE if codelengh is large and coderate is high. We also compute and analyze the decorder error probabilities of some binary primitive BCH codes.