On computing the weight spectrum of cyclic codes
Barg, A.M.
Dumer, I.I.
Inst. for Problems of Inf. Transmission, Moscow ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jul 1992
Volume: 38,
Issue: 4
On page(s): 1382-1386
ISSN: 0018-9448
References Cited: 15
CODEN: IETTAW
INSPEC Accession Number: 4251120
Digital Object Identifier: 10.1109/18.144721
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
