Computing the probability of undetected error for shortened cyclic codes

TitleComputing the probability of undetected error for shortened cyclic codes
Publication TypeJournal Article
Year of Publication1992
AuthorsAgarwal, V. K., and A. Ivanov
JournalCommunications, IEEE Transactions on
Pagination494 -499
Date Publishedmar.
Keywordsbit error probabilities, burst errors, channels, code block length, code generator polynomials, error detection codes, linear block codes, probability, recursive method, shortened cyclic codes, telecommunication channels, time complexity

The authors present a general technique for computing P e for all possible shortened versions of cyclic codes generated by any given polynomial. The technique is recursive, i.e. computes Pe for a given code block length n from that of the code block length n-1. The proposed computation technique for determining Pe does not require knowledge of the code weight distributions. For a generator polynomial of degree r, and |g| nonzero coefficients, the technique yields Pe for all code block lengths up to length n in time complexity O(n|g |2r+|g|). Channels with variable bit error probabilities can be analyzed with the same complexity. This enables the performance of the code generator polynomials to be analyzed for burst errors


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia