DocumentCode :
1355939
Title :
The weight distributions of extended binary primitive BCH codes of length 128
Author :
Desaki, Yoshihisa ; Fujiwara, Toru ; Kasami, Tadao
Author_Institution :
Fac. of Eng. Sci., Osaka Univ., Japan
Volume :
43
Issue :
4
fYear :
1997
fDate :
7/1/1997 12:00:00 AM
Firstpage :
1364
Lastpage :
1371
Abstract :
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
Keywords :
BCH codes; block codes; computational complexity; dual codes; error correction codes; error detection codes; linear codes; trellis codes; BCH codes; extended binary primitive codes; invariant property; length 128 code; linear block code; monotonicity; reduced computational complexity; self-dual code; trellis diagram; trellis structure; undetectable error probability; weight distribution; Application software; Bit error rate; Block codes; Computational complexity; Distributed computing; Information science; Information theory; Linear code; Meetings; Performance analysis;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.605611
Filename :
605611
Link To Document :
بازگشت