On error-and-erasure decoding of cyclic codes
暂无分享,去创建一个
[1] 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.
[2] Patrick Stevens. Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound , 1990, IEEE Trans. Inf. Theory.
[3] Carlos R. P. Hartmann,et al. Generalizations of the BCH Bound , 1972, Inf. Control..
[4] Gui Liang Feng,et al. A generalized Euclidean algorithm for multisequence shift-register synthesis , 1989, IEEE Trans. Inf. Theory.
[5] Gui Liang Feng,et al. A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.
[6] G. David Forney,et al. On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.
[7] K. K. Tzeng,et al. Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[8] Po Chen. Multisequence Linear Shift Register Synthesis and Its Application to BCH Decoding , 1976, IEEE Trans. Commun..