An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Upper Bounds on the Dual Distance of BCH(255, k)
Designs, Codes and Cryptography
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Long extended BCH codes are spanned by minimum weight words
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 754.84 |
In previous work, a method was presented to compute the weight distribution of a linear block code by using its trellis diagram. In this correspondence, the method is improved by using the trellis structure of linear block codes. Another method with reduced computational complexity is also proposed which uses the invariant property of a code. With these methods, the weight distributions of all extended binary primitive BCH codes of length 128 are computed, except for those for which the formulas of the weight distribution are known. It turns out that (128,64,22) extended binary primitive BCH code is formally self-dual. The probability of an undetectable error for each code is computed and its monotonicity is examined