Construction of Some Good Binary Linear Codes Using Hadamard Matrix and BCH Codes
暂无分享,去创建一个
[1] Yue Dianwu,et al. On the dimension and minimum distance of BCH codes over GF(q) , 1996 .
[2] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[3] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[4] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[5] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[6] Pascale Charpin,et al. Studying the locator polynomials of minimum weight codewords of BCH codes , 1992, IEEE Trans. Inf. Theory.
[7] Daniel Augot,et al. Idempotents and the BCH bound , 1994, IEEE Trans. Inf. Theory.
[8] M. Tomlinson,et al. Bounds on Error-Correction Coding Performance , 2017 .
[9] Robert H. Morelos-Zaragoza,et al. The Art of Error Correcting Coding: Morelos-Zaragoza/The Art of Error Correcting Coding, Second Edition , 2006 .