Bounded distance+1 soft-decision Reed-Solomon decoding
暂无分享,去创建一个
[1] David S. Slepian,et al. A note off two binary signaling alphabets , 1956, IRE Trans. Inf. Theory.
[2] Jørn Justesen,et al. On the complexity of decoding Reed-Solomon codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[3] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[4] Robert Mario Fano,et al. A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.
[5] J. Wolf. Adding two information symbols to certain nonbinary BCH codes and some applications , 1969 .
[6] K. Araki,et al. The Generalized Syndrome Polynomial and its Application to the Efficient Decoding of Reed-Solomon Codes Based on Gmd Criterion , 1993, Proceedings. IEEE International Symposium on Information Theory.
[7] R. Gallager. Information Theory and Reliable Communication , 1968 .
[8] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[9] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[10] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[11] E. Berlekamp. Factoring polynomials over large finite fields , 1970 .
[12] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[13] Elwyn R. Berlekamp,et al. Bit-serial Reed - Solomon encoders , 1982, IEEE Transactions on Information Theory.
[14] R. Kotter,et al. A New Efficient Error-Erasure Location Scheme in Gmd Decoding , 1993, Proceedings. IEEE International Symposium on Information Theory.
[15] Elwyn R. Berlekamp,et al. A lower bound to the distribution of computation for sequential decoding , 1967, IEEE Trans. Inf. Theory.
[16] Nicholas J. Patterson,et al. The algebraic decoding of Goppa codes , 1975, IEEE Trans. Inf. Theory.
[17] E.R. Berlekamp,et al. The technology of error-correcting codes , 1980, Proceedings of the IEEE.
[18] Ulrich K. Sorger. A new Reed-Solomon code decoding algorithm based on Newton's interpolation , 1993, IEEE Trans. Inf. Theory.
[19] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[20] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[21] D. Slepian. A class of binary signaling alphabets , 1956 .
[22] Masao Kasahara,et al. Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes , 1992, IEEE Trans. Inf. Theory.
[23] Masao Kasahara,et al. A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..
[24] Shu Lin,et al. Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application , 1966, Inf. Control..