A q-polynomial approach to cyclic codes
暂无分享,去创建一个
Cunsheng Ding | San Ling | C. Ding | S. Ling
[1] Robert T. Chien,et al. Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes , 1964, IEEE Trans. Inf. Theory.
[2] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .
[3] Rudolf Lide,et al. Finite fields , 1983 .
[4] Felix Ulmer,et al. Coding with skew polynomial rings , 2009, J. Symb. Comput..
[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[6] Philippe Delsarte,et al. On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[7] T. Schaub. A linear complexity approach to cyclic codes , 1988 .
[8] Felix Ulmer,et al. Skew-cyclic codes , 2006, Applicable Algebra in Engineering, Communication and Computing.
[9] W. Cary Huffman,et al. Fundamentals of Error-Correcting Codes , 1975 .
[10] Robert J. McEliece,et al. Weights of Irreducible Cyclic Codes , 1972, Inf. Control..
[11] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[12] Tor Helleseth,et al. Use characteristic sets to decode cyclic codes up to actual minimum distance , 1996 .
[13] G. David Forney,et al. On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.
[14] Leopold Bömer,et al. Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span , 1992, IEEE Trans. Inf. Theory.
[15] Gui Liang Feng,et al. Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations , 1991, IEEE Trans. Inf. Theory.