DocumentCode :
886043
Title :
On computing the weight spectrum of cyclic codes
Author :
Barg, Alexander M. ; Dumer, Ilya I.
Author_Institution :
Inst. for Problems of Inf. Transmission, Moscow, Russia
Volume :
38
Issue :
4
fYear :
1992
fDate :
7/1/1992 12:00:00 AM
Firstpage :
1382
Lastpage :
1386
Abstract :
Two deterministic algorithms of computing the weight spectra of binary cyclic codes are presented. These algorithms have the lowest known complexity for cyclic codes. For BCH codes of lengths 63 and 127, several first coefficients of the weight spectrum in number sufficient to evaluate the bounded distance decoding error probability are computed
Keywords :
computational complexity; error correction codes; BCH codes; binary cyclic codes; bounded distance decoding error probability; complexity; deterministic algorithms; weight spectrum; Conferences; Decoding; Error correction codes; Error probability; Hamming weight; Information theory; Linear code;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.144721
Filename :
144721
Link To Document :
بازگشت