Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
暂无分享,去创建一个
It is shown that error-erasure decoding for a cyclic code allows the correction of a combination of t errors and r erasures when 2t+r >
[1] G. David Forney,et al. On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.
[2] Patrick Stevens. Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities , 1988, IEEE Trans. Inf. Theory.
[3] Carlos R. P. Hartmann,et al. Generalizations of the BCH Bound , 1972, Inf. Control..
[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .